Identifying Approximate Palindromes in Run-Length Encoded Strings

DOI10.1007/978-3-642-17514-5_29zbMath1310.68265OpenAlexW1484466367MaRDI QIDQ3060786

Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao

Publication date: 9 December 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_29

Mathematics Subject Classification ID

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

Related Items (1)

Palindromic subsequence automata and longest common palindromic subsequence

This page was built for publication: Identifying Approximate Palindromes in Run-Length Encoded Strings