Overcoming the memory bottleneck in suffix tree construction

This publication has 11 references indexed in Scilit:

• Uniform memory hierarchies
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Optimal suffix tree construction with large alphabets
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• On sorting strings in external memory (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1997
• Algorithms for parallel memory, I: Two-level memories
  Algorithmica, 1994
• An introduction to disk drive modeling
  Computer, 1994
• The I/O subsystem/spl minus/a candidate for improvement
  Computer, 1994
• Suffix Arrays: A New Method for On-Line String Searches
  SIAM Journal on Computing, 1993
• The input/output complexity of sorting and related problems
  Communications of the ACM, 1988
• A Space-Economical Suffix Tree Construction Algorithm
  Journal of the ACM, 1976
• Linear pattern matching algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1973