Palindrome pattern matching

DOI10.1016/J.TCS.2012.01.047MaRDI QIDQ390901zbMATH OpenOpenAlexFDO

Authors Shunsuke Inenaga, Masayuki Takeda, Tomohiro I

Publication date 9 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.01.047

zbMATH Keywords

pattern matchingsuffix treeslinear time algorithmspalindromesborder arrays

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Palindrome pattern matching
• Pattern avoidance by palindromes
• scientific article; zbMATH DE number 410195
• Optimal Regular Expressions for Palindromes of Given Length
• Avoidability of palindrome patterns
• Pattern Matching
• scientific article; zbMATH DE number 4164945

Cites work

• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Algorithms on Strings, Trees and Sequences
• Burrows-Wheeler transform and palindromic richness
• Counting distinct palindromes in a word in linear time
• Episturmian words and some constructions of de Luca and Rauzy
• Finding all approximate gapped palindromes
• New trie data structures which support very fast search operations
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On-line construction of suffix trees
• Palindrome complexity.
• Palindromic richness
• Parameterized pattern matching: Algorithms and applications
• Searching for gapped palindromes
• Surpassing the information theoretic bound with fusion trees
• Total palindrome complexity of finite words

Cited in

(10)

• Palindrome pattern matching
• Block palindromes: a new generalization of palindromes
• Pattern avoidance by palindromes
• Finding maximal 2-dimensional palindromes
• Finding palindromes: variants and algorithms
• Palindromic length in linear time
• Finding all the palindromes in a binary tree in linear time and space
• scientific article; zbMATH DE number 6691399 (Why is no real title available?)
• Finding maximal 2-dimensional palindromes
• Generalized pattern matching and periodicity under substring consistent equivalence relations

This page was built for publication: Palindrome pattern matching

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