Identifying approximate palindromes in run-length encoded strings

DOI10.1007/978-3-642-17514-5_29zbMATH Open1310.68265OpenAlexW1484466367MaRDI QIDQ3060786FDOQ3060786

Authors: 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

Recommendations

• Efficient retrieval of approximate palindromes in a run-length encoded string
• Finding approximate palindromes in strings
• scientific article; zbMATH DE number 1786446
• Approximate matching of run-length compressed strings
• Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

Mathematics Subject Classification ID

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

Cited In (10)

• Palindromic rich words and run-length encodings
• Palindromic subsequence automata and longest common palindromic subsequence
• Efficient retrieval of approximate palindromes in a run-length encoded string
• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
• Finding approximate palindromes in strings
• Palindrome recognition using a multidimensional tape.
• Efficient Computation of Palindromes in Sequences with Uncertainties*
• FINDING ALL APPROXIMATE GAPPED PALINDROMES
• Title not available (Why is that?)
• Approximate On-line Palindrome Recognition, and Applications

This page was built for publication: Identifying approximate palindromes in run-length encoded strings

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