Computing the Longest Common Subsequence of Two Run-Length Encoded Strings

DOI10.1007/978-3-642-35261-4_23zbMath1260.68492OpenAlexW192748094MaRDI QIDQ4909536

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)

Related Items (2)

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions ⋮ Unnamed Item

This page was built for publication: Computing the Longest Common Subsequence of Two Run-Length Encoded Strings