Indexing Circular Patterns

DOI10.1007/978-3-540-77891-2_5zbMath1132.68350OpenAlexW1559776438MaRDI QIDQ5452151

M. Sohel Rahman, Costas S. Iliopoulos

Publication date: 25 March 2008

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_5

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (6)

Efficient Data Structures for the Orthogonal Range Successor Problem ⋮ Fast circular dictionary-matching algorithm ⋮ Searching and Indexing Circular Patterns ⋮ Optimal prefix and suffix queries on texts ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor ⋮ Average-optimal string matching

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate string matching using compressed suffix arrays
• Lexicographically least circular substrings
• Optimal canonization of all substrings of a string
• On-line construction of suffix trees
• Constructing suffix arrays in linear time
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Factorizing words over an ordered alphabet
• Linear work suffix array construction
• Pattern matching with address errors
• Fast canonization of circular strings
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Pattern Matching with Swaps

This page was built for publication: Indexing Circular Patterns