Suffix cactus: A cross between suffix tree and suffix array
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 191-204
- https://doi.org/10.1007/3-540-60044-2_43
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient implementation of suffix treesSoftware: Practice and Experience, 1995
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Approximate string matching with suffix automataAlgorithmica, 1993
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Improved behaviour of tries by adaptive branchingInformation Processing Letters, 1993
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Efficient text searching of regular expressionsPublished by Springer Nature ,1989
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976