Indexing Circular Patterns
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 46-57
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Linear work suffix array constructionJournal of the ACM, 2006
- Space efficient linear time construction of suffix arraysJournal of Discrete Algorithms, 2005
- Constructing suffix arrays in linear timeJournal of Discrete Algorithms, 2005
- Pattern Matching with SwapsJournal of Algorithms, 2000
- On-line construction of suffix treesAlgorithmica, 1995
- Optimal canonization of all substrings of a stringInformation and Computation, 1991
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Fast canonization of circular stringsJournal of Algorithms, 1981
- Lexicographically least circular substringsInformation Processing Letters, 1980
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976