A new method for indexing genomes using on-disk suffix trees

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 649-658

  Barsky, Marina ^a   Stege, Ulrike ^a   Thomo, Alex ^a   Upton, Chris ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Disk structures; DNA indexing; Suffix tree

Indexed keywords

BINARY REPRESENTATIONS; DISK DATA; DISK STRUCTURES; DISK-BASED; GENOMIC DATA; INPUT STRING; RANDOM ACCESS; SUFFIX TREE; SUFFIX-TREES;

DNA; GENES; INDEXING (OF INFORMATION); KNOWLEDGE MANAGEMENT; NUCLEIC ACIDS;

DISKS (STRUCTURAL COMPONENTS);

EID: 70349231590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458170     Document Type: Conference Paper

References (36)

1. M.I. ABOUELHODA, S. KURTZ, AND E. OHLEBUSCH Replacing suffix trees with enhanced suffix arrays. J. of Discrete Algorithms, 2(1): 53-86, 2004.
2. S.J. BEDATHUR AND J.R. HARITSA Engineering a fast online persistent suffix tree construction. 20th Intl. Conf. on Data Engineering, 2004.
3. C.F. CHEUNG, J.X. YU, AND H. LU Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering, 17(1): 90-105, 2005.
4. R. CLIFFORD, AND M.J. SERGOT Distributed and paged suffix trees for large genetic databases. Proc. of 14th Symposium on Combinatorial Pattern Matching: 70-82, 2003.
5. A. CRAUSER AND P. FERRAGINA A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. Algoritmica, 32(1): 1-35, 2002.
6. A.L. DELCHER, S. KASIF, R.D. FLEISCHMANN, J. PETERSON, O. WHITE AND S.L. SALZBERG Alignment of whole genomes. Nucl. Acids. Res., 27(11): 2369-2376, 1999.
7. A.L. DELCHER, A. PHILLIPPY, J. CARLTON, AND S.L. SALZBERG Fast algorithms for large-scale genome alignment and comparison. Nucl. Acids. Res., 30(11): 2478-2483, 2002.
8. R. DEMENTIEV, J. KÄRKKÄINEN, J. MEHNERT, AND P. SANDERS Better external memory suffix array construction. Proc. of the 7th Workshop on Algorithm Engineering and Experiments, 2005.
9. P. FERRAGINA AND R. GROSSI The string B-tree: a new data structure for string search in external memory and its applications. J. of the ACM, 46(2): 1999.
10. H. GARCIA-MOLINA, J.D. ULLMAN, J.D. WIDOM Database System Implementation. Prentice-Hall, Inc, 1999.
11. D. GUSFIELD Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
12. W-K. HON, K. SADAKANE, AND W.-K. SUNG Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science: 251, 2003
13. E. HUNT, M.P. ATKINSON, and R.W. IRVING A database index to large biological sequences. The VLDB Jornal, 7(3): 139-148, 2001.
14. J. KÄRKKÄINEN, AND P. Sanders Simple linear work suffix array construction. Proc. 13th Int. Conf. on Automata, Languages and Programming, 2003
15. D.K. KIM, J.S. SIM, H. PARK, AND K. PARK Linear-time construction of suffix arrays: (Extended abstract). Proc. of CPM Conf., LNCS 2676: 189-199, 2003
16. P. KO AND S. ALURU Space efficient linear time construction of suffix arrays. J. of Discrete Algorithms, 3 (2-4): 143-156, 2005
17. S. KURTZ Reducing Space Requirement of Suffix Trees. Software Practice and Experience, 29(13): 1149-1171, 1999.
18. S. KURTZ, A. PHILLIPPY, A.L. DELCHER, M. SMOOT, M. SHUMWAY, C. ANTONESCU, AND S.L. SALZBERG Versatile and open software for comparing large genomes. Genome Biology, 5(R12): 2004.
19. N.J. LARSSON AND K. SADAKANE Faster suffix sorting. Tech. Rep. LUCS-TR:99-214 of the Dept. of Comp. Sc., Lund University, Sweden, 1999.
20. U. MANBER AND E. MYERS Suffix Arrays: A New Method for On-Line String Searches. SIAM J. of Computing, 22(5):935-948, 1993.
21. G. MANZINI AND P. FERRAGINA Engineering a lightweight suffix array construction algorithm. Algorithmica, 40: 33-50, 2004.
22. B. PHOOPHAKDEE AND M.J. ZAKI Genome-scale Disk-based Suffix Tree Indexing. ACM SIGMOD Int. Conf. on Management of Data, 2007.
23. B. PHOOPHAKDEE AND M.J. ZAKI Trellis+: An Effective Approach for Indexing Massive Sequence. Pacific Symposium on Biocomputing, 2008.
24. E. PENNISI DNA Study Forces Rethink of What It Means to Be a Gene. Science, 316 (5831): 1556-7, 2007
25. S.J. PUGLISI, W.F. SMYTH AND A.H. TURPIN A taxonomy of suffix array construction algorithms. ACM Comput. Surv., 39(2): 2007.
26. T. RYAN Gregory The evolution of the genome. Academic Press, 2005.
27. K. SCHURMANN, J. STOYE Suffix-tree construction and storage with limited main memory. Tech. Rep. 2003-06 of the University of Bielefeld, Germany, 2003.
28. R. SINHA, S.J. PUGLISI, A. MOFFAT, AND A. TURPIN Improving suffix array locality for fast pattern matching on disk. Proc. of 2008 SIGMOD Conf., 661-672, 2008.
29. A. STARK ET AL. Discovery of functional elements in 12 Drosophila genomes using evolutionary signatures. Nature, 450 : 219-232, 2007.
30. S. TATA, R.A. HANKINS, AND J.M. PATEL Practical suffix tree construction. Proc. of 30th VLDB Conf., 36-47, 2004
31. Y. TIAN, S. TATA, R. HANKINS, AND J. PATEL Practical methods for constructing suffix trees. The VLDB Journal, 14(3) : 281-299, 2005.
32. E. Ukkonen On-line construction of suffix trees. Algorithmica, 14(3): 1995.
33. A. WOOLFE ET AL. Highly conserved non-coding sequences are associated with vertebrate development. PLoS Biology, 3(1), e7 doi:10.1371/journal.pbio.0030007
34. Strings, Compression, and Orchestra: www.larsson.dogma.net/research. html
35. USCS Genome Browser: hgdownload.cse.ucsc.edu/downloads.html
36. Benjarath Pupacdi's Home Page: www.cs.rpi.edu/̃zaki/software/ trellis