Amanote Research
Register
Sign In
Overcoming the Memory Bottleneck in Suffix Tree Construction
doi 10.1109/sfcs.1998.743441
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
M. Farach
P. Ferragina
S. Muthukrishnan
Publisher
IEEE Comput. Soc
Related search
Better External Memory Suffix Array Construction
Journal of Experimental Algorithmics
Theoretical Computer Science
The Suffix Tree of a Tree and Minimizing Sequential Transducers
BRICS Report Series
Willows: A Memory Efficient Tree and Forest Construction Package
BMC Bioinformatics
Biochemistry
Applied Mathematics
Computer Science Applications
Structural Biology
Molecular Biology
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Communications in Computer and Information Science
Mathematics
Computer Science
Improving Suffix Tree Clustering Algorithm for Web Documents
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Suffix Tree Based Approach for Chinese Information Retrieval
Bottleneck Detour Tree of Points on a Path
Computational Geometry: Theory and Applications
Control
Optimization
Geometry
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Topology
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
SIAM Journal on Computing
Mathematics
Computer Science
