Optimal On-Line Search and Sublinear Time Update in String Matching
- 1 June 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (3) , 713-736
- https://doi.org/10.1137/s0097539795286119
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Dynamic Text Indexing under String UpdatesJournal of Algorithms, 1997
- Parameterized Pattern Matching: Algorithms and ApplicationsJournal of Computer and System Sciences, 1996
- A Generalization of the Suffix Tree to Square Matrices, with ApplicationsSIAM Journal on Computing, 1995
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- Dynamic dictionary matchingJournal of Computer and System Sciences, 1994
- Parallel construction of minimal suffix and factor automataInformation Processing Letters, 1990
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985