Finding palindromes: variants and algorithms

DOI10.1007/978-3-642-40355-2_18MaRDI QIDQ5410458zbMATH OpenOpenAlexFDO

Authors Johan Jeuring

Publication date 16 April 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Finding approximate palindromes in strings
• Palindrome pattern matching
• Parallel detection of all palindromes in a string
• Palindrome pattern matching
• scientific article; zbMATH DE number 6691399

Cites work

• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• The derivation of on-line algorithms, with an application to finding palindromes

Cited in

(3)

• Palindrome recognition using a multidimensional tape.
• FINDING ALL APPROXIMATE GAPPED PALINDROMES
• A subquadratic algorithm for minimum palindromic factorization

This page was built for publication: Finding palindromes: variants and algorithms

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