Computing the longest common subsequence of two run-length encoded strings

DOI10.1007/978-3-642-35261-4_23MaRDI QIDQ4909536zbMATH OpenOpenAlexFDO

Authors Yoshifumi Sakai

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• A new efficient algorithm for computing the longest common subsequence

Cited in

(9)

• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• Dynamic RLE-compressed edit distance tables under general weighted cost functions
• RLE edit distance in near optimal time
• Computing longest common subsequence under Cartesian-tree matching model
• Subsequence matching and LCS under Cartesian-tree equivalence
• Compressed dictionary matching on run-length encoded strings
• Compressed dictionary matching on run-length encoded strings
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

This page was built for publication: Computing the longest common subsequence of two run-length encoded strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909536)