Trellis+: An effective approach for indexing genome-scale sequences using suffix trees

Pacific Symposium on Biocomputing 2008, PSB 2008

Volumn , Issue , 2008, Pages 90-101

  Phoophakdee, Benjarath ^a   Zaki, Mohammed J ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFERING STRATEGY; DATA MANAGEMENT TECHNIQUES; DISK-BASED; EXPONENTIAL GROWTH; HIGH-THROUGHPUT; HUMAN GENOMES; MAIN-MEMORY; SEQUENCE DATA; SEQUENCING METHOD; SOURCE CODES; SUFFIX-TREES;

DIGITAL STORAGE; FORESTRY; GENES; INFORMATION MANAGEMENT;

TREES (MATHEMATICS);

ALGORITHM; ANIMAL; ARTICLE; BIOLOGY; COMPUTER PROGRAM; DATA BASE; DOCUMENTATION; GENOME; GENOMICS; HUMAN; SEQUENCE ANALYSIS; STATISTICS;

ABSTRACTING AND INDEXING AS TOPIC; ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; DATABASE MANAGEMENT SYSTEMS; GENOME, HUMAN; GENOMICS; HUMANS; SEQUENCE ANALYSIS; SOFTWARE;

EID: 40549085012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S. J. Bedathur and J. R. HaritsA. Engineering a fast online persistent suffix tree construction. In 20th Int'l Conference on Data Engineering, 2004.
2. A. L. Brown. Constructing genome scale suffix trees. In 2nd Asia-Pacific Bioinformatics Conference, 2004.
3. C.-F. Cheung, J. X. Yu, and H. Lu. Const, ructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering, 17(1):90-105, 2005.
4. A. L. Delcher, A. Phillippy, E. Carlton, and S. L. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Research, 30(11):2478-2483, 2002.
5. R. Dementiev, J. Karkkainen, J. Mehnert, and P. Sanders. Better external memory suffix array construction. In Workshop on Algorithm Engineering and Experiments, 2005.
6. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. J. of the ACM, 47(6):987-1011, 2000.
7. P. Ferragina and R. Grossi. The string B-tree: a new data structure for string search in external memory and its applications. Journal of the ACM, 46( 2) :236-280, 1999.
8. R. Giegerich, S. Kurtz, and J. Stoye. Efficient implementation of lazy suffix trees. Software Practice & Experience, 33( 11):1035-1049, 2003.
9. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge Uni-versity Press, 1997.
10. K. Heumann and H. W. Mewes. The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices. In 3rd South American Workshop on String Processing, 1996.
11. E. Hunt, M. P. Atkinson, and R. W. Irving. A database index to large biolog-ical sequences. In 27th Int'l Conference on Very Large Data Bases, 2001.
12. R. Japp. The top-compressed suffix tree: A disk-resident index for large sequences. In BNCOD Bioinformatics Workshop, 2004.
13. B. Phoophakdee and M. J. Zaki. Genome-scale disk-based suffix tree index-ing. In ACM SIGMOD Int'l Conference on Management of Data, 2007.
14. K. Sadakane and T. Shibuy A. Indexing huge genome sequences for solving various problems. Genome Informatics, 12:175-183, 2001.
15. Y. Tian, S. Tata, R. A. Hankins, and J. M. Patel. Practical methods for con-structing suffix trees. VLDB Journal, 14(3):281-299, 2005.
16. E. Ukkonen. On-line construction of suffix frees. Algorithmica, 14(3), 1995.