Edit distance of run-length encoded strings

References

Page 1

	Year	Citations
Binary codes capable of correcting deletions, insertions and reversals V.I. Levenshtein Soviet physics. Doklady EngineeringInformation RetrievalString-searching AlgorithmProgram AnalysisKnowledge Discovery	1965	10.4K
Algorithms for approximate string matching Esko Ukkonen Information and Control EngineeringInformation RetrievalData ScienceData MiningString-searching Algorithm	1985	615
Finding approximate patterns in strings Esko Ukkonen Journal of Algorithms Approximate PatternsEngineeringData ScienceData MiningPattern Recognition	1985	385
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson SIAM Journal on Computing EngineeringSimilarity MeasureComputational ComplexitySequence AlignmentSequence Design	2003	142
An improved algorithm for computing the edit distance of run-length coded strings Horst Bunke, János Csirik Information Processing Letters String-searching AlgorithmImproved AlgorithmString ProcessingCombinatorial Pattern MatchingComputer Science	1995	65
Matching for Run-Length Encoded Strings Alberto Apostolico, Gad M. Landau, Steven Skiena Journal of Complexity EngineeringString-searching AlgorithmString ProcessingRun-length Encoded StringsCombinatorial Pattern Matching	1999	62
A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson	2002	60
Approximate Matching of Run-Length Compressed Strings Veli Mäkinen, Esko Ukkonen, Navarro Algorithmica Approximate MatchingEngineeringString-searching AlgorithmString ProcessingCombinatorial Pattern Matching	2003	44

Page 1