Efficient and Elegant Subword-Tree Construction
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Building the minimal DFA for the set of all subwords of a word on-line in linear timePublished by Springer Nature ,1984
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Efficient On-Line Construction and Correction of Position TreesSIAM Journal on Computing, 1980
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973