Probabilistic analysis of generalized suffix trees
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Self-alignments in words and their applicationsJournal of Algorithms, 1992
- A Note on the Height of Suffix TreesSIAM Journal on Computing, 1992
- Analysis of digital tries with Markovian dependencyIEEE Transactions on Information Theory, 1991
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Average sizes of suffix trees and DAWGsDiscrete Applied Mathematics, 1989
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Estimating the information content of symbol sequences and efficient codesIEEE Transactions on Information Theory, 1989
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- String overlaps, pattern matching, and nontransitive gamesJournal of Combinatorial Theory, Series A, 1981
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976