A sublinear time string prefix square detection algorithm

DOI10.1080/09720529.2006.10698063zbMath1103.68041OpenAlexW2152498234MaRDI QIDQ5473096

No author found.

Publication date: 19 June 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698063

zbMATH Keywords

matching algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

Onn-power prefix languages

Cites Work

• On-line construction of suffix trees
• Efficient string matching
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
• Simple and flexible detection of contiguous repeats using a suffix tree

This page was built for publication: A sublinear time string prefix square detection algorithm