Edit distance for a run-length-encoded string and an uncompressed string

Authors:
J. J. Liu;G. S. Huang;Y. L. Wang;R. C. T. Lee
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan and Department of Computer Science and Information Engineering, National Chi Nan Universi ...;Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan
Venue:
Information Processing Letters
Year:
2008

Citing 10
Cited 7

Algorithms for approximate string matching

Information and Control
Data structures and algorithms for approximate string matching

Journal of Complexity
An improved algorithm for approximate string matching

SIAM Journal on Computing
Approximate Boyer-Moore string matching

SIAM Journal on Computing
An improved algorithm for computing the edit distance of run-length coded strings

Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Introduction to data compression

Introduction to data compression
Edit distance of run-length encoded strings

Information Processing Letters
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

SIAM Journal on Computing
Approximating Edit Distance Efficiently

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

Sequence Alignment Algorithms for Run-Length-Encoded Strings

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

Information Processing Letters
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A web-based comparative visualization system for human endogenous RetroVirus(HERV) on whole genomes

Proceedings of the third international workshop on Data and text mining in bioinformatics
Hardness of comparing two run-length encoded strings

Journal of Complexity
A fully compressed algorithm for computing the edit distance of run-length encoded strings

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Hardness of longest common subsequence for sequences with bounded run-lengths

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.89

Visualization

Abstract

We propose a new algorithm for computing the edit distance of an uncompressed string against a run-length-encoded string. For an uncompressed string of length n and a compressed string with M runs, the algorithm computes their edit distance in time O(Mn). This result directly implies an O(min{mN,Mn}) time algorithm for strings of lengths m and n with M and N runs, respectively. It improves the previous best known time bound O(mN+Mn).