Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

doi 10.1137/1.9781611975994.99
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Beyond Worst-Case Analysis for Joins With Minesweeper

2014English

Towards Normalizing the Edit Distance Using a Genetic Algorithms–Based Scheme

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

Comparing Heuristics for Graph Edit Distance Computation

VLDB Journal
HardwareInformation SystemsArchitecture
2019English

Edit Distance Based Encryption and Its Application

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Efficient Alignment and Correspondence Using Edit Distance

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

On the Worst-Case Behavior of String-Searching Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1977English

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

Computation of Normalized Edit Distance and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy