Edit distance of run-length encoded strings

Authors:
Ora Arbell;Gad M. Landau;Joseph S. B. Mitchell
Affiliations:
Department of Computer Science, Haifa University, Haifa 31905, Israel;Department of Computer Science, Haifa University, Haifa 31905, Israel and Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY;Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 10

Algorithms for approximate string matching

Information and Control
An improved algorithm for computing the edit distance of run-length coded strings

Information Processing Letters
Matching for run-length encoded strings

Journal of Complexity
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Matching of Run-Length Compressed Strings

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching

Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

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

Information Processing Letters
The SBC-tree: an index for run-length compressed sequences

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Computing similarity of run-length encoded strings with affine gap penalty

Theoretical 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 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
Random access to grammar-compressed strings

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing similarity of run-length encoded strings with affine gap penalty

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y|k) time algorithm that computes their edit distance.