Matching for run-length encoded strings

Edit distance of run-length encoded strings

Information Processing Letters

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

Finding a longest common subsequence between a run-length-encoded string and an uncompressed string

Journal of Complexity

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

Weighted LCS

Journal of Discrete Algorithms

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

Restricted LCS

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval

Weighted shortest common supersequence

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval

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

Fast algorithms for computing the constrained LCS of run-length encoded strings

Theoretical Computer Science

Hardness of longest common subsequence for sequences with bounded run-lengths

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

Speeding up HMM decoding and training by exploiting sequence repetitions

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching