A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings

DOI10.1007/978-3-642-15775-2_36zbMath1287.68189OpenAlexW1555209979MaRDI QIDQ3586482

Kuan-Yu Chen, Kun-Mao Chao

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_36

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (2)

An Opportunistic Text Indexing Structure Based on Run Length Encoding ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string

This page was built for publication: A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings