On-line construction of suffix trees
- 1 September 1995
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 14 (3), 249-260
- https://doi.org/10.1007/bf01206331
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximate string-matching over suffix treesPublished by Springer Nature ,2005
- String matching with constraintsPublished by Springer Nature ,2005
- Adaptive dictionary matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Time optimal left to right construction of position treesActa Informatica, 1987
- Transducers and repetitionsTheoretical Computer Science, 1986
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975