Space Efficient Suffix Trees
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A time and space efficient data structure for string searching on large textsInformation Processing Letters, 1996
- Sparse suffix treesLecture Notes in Computer Science, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Space-efficient static trees and graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Sequence landscapesNucleic Acids Research, 1986
- Introducing efficient parallelism into approximate string matching and a new serial algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Structural properties of the string statistics problemJournal of Computer and System Sciences, 1985
- Analyzing and compressing assembly codePublished by Association for Computing Machinery (ACM) ,1984
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975