Approximate On-line Palindrome Recognition, and Applications
From MaRDI portal
(Redirected from Publication:5165587)
Recommendations
- scientific article; zbMATH DE number 6691399
- Identifying approximate palindromes in run-length encoded strings
- The derivation of on-line algorithms, with an application to finding palindromes
- Finding approximate palindromes in strings
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Efficient Computation of Palindromes in Sequences with Uncertainties*
- On palindromic sequence automata and applications
- Detecting palindromes, patterns and borders in regular languages
Cited in
(12)- The derivation of on-line algorithms, with an application to finding palindromes
- Palindrome recognition using a multidimensional tape.
- Finding maximal 2-dimensional palindromes
- 2-dimensional palindromes with k mismatches
- Pattern matching with non overlapping reversals -- approximation and on-line algorithms
- scientific article; zbMATH DE number 6691399 (Why is no real title available?)
- Efficient Computation of Palindromes in Sequences with Uncertainties*
- \(\mathrm{Pal}^{k}\) is linear recognizable online
- Open problems related to palindrome recognition: are there open problems related to palindrome recognition?
- Double-ended palindromic trees in linear time
- Small-space algorithms for the online language distance problem for palindromes and squares
- Small space encoding and recognition of k-palindromic prefixes
This page was built for publication: Approximate On-line Palindrome Recognition, and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165587)
