Serial and parallel methods for i/o efficient suffix tree construction
- 29 June 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 827-840
- https://doi.org/10.1145/1559845.1559931
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized DatasetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Genome-scale disk-based suffix tree indexingPublished by Association for Computing Machinery (ACM) ,2007
- Practical methods for constructing suffix treesThe VLDB Journal, 2005
- Constructing suffix tree for gigabyte sequences with megabyte memoryIEEE Transactions on Knowledge and Data Engineering, 2005
- Search-Optimized Suffix-Tree Storage for Biological ApplicationsLecture Notes in Computer Science, 2005
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- Efficient Extraction of Structured Motifs Using Box-LinksLecture Notes in Computer Science, 2004
- Web document clusteringPublished by Association for Computing Machinery (ACM) ,1998
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973