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
Information Processing Letters
Edit distance for a run-length-encoded string and an uncompressed string
Information Processing Letters
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
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
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
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
Hi-index | 0.89 |