A Note on the Height of Suffix Trees
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (1) , 48-53
- https://doi.org/10.1137/0221005
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Self-alignments in words and their applicationsJournal of Algorithms, 1992
- Average sizes of suffix trees and DAWGsDiscrete Applied Mathematics, 1989
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- Partial match retrieval of multidimensional dataJournal of the ACM, 1986
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- On the performance evaluation of extendible hashing and trie searchingActa Informatica, 1983
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- On the application of the Borel-Cantelli lemmaTransactions of the American Mathematical Society, 1952