Indexing Circular Patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 5263622 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Approximate string matching using compressed suffix arrays
- Constructing suffix arrays in linear time
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Fast canonization of circular strings
- Jewels of Stringology
- Lexicographically least circular substrings
- Linear work suffix array construction
- On-line construction of suffix trees
- Optimal canonization of all substrings of a string
- Pattern Matching with Swaps
- Pattern matching with address errors
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(9)- Optimal prefix and suffix queries on texts
- Searching and indexing circular patterns
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Average-optimal string matching
- Quasi-linear-time algorithm for a longest common circular factor
- Fast circular dictionary-matching algorithm
- Sorting circular suffixes in linear time
- Succinct indexes for circular patterns
This page was built for publication: Indexing Circular Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452151)