WHAM: A high-throughput sequence alignment method

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 445-456

  Li, Yinan ^a   Terrell, Allison ^a   Patel, Jignesh M ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

approximate string matching; bit parallelism; sequence alignment

Indexed keywords

DATA HANDLING;

'CURRENT; APPROXIMATE STRING MATCHING; BIT PARALLELISM; DATA PROCESSING METHODS; GENOMIC SEQUENCE; HIGH-THROUGHPUT; NEXT-GEN SEQUENCING; SEQUENCE ALIGNMENT METHODS; SEQUENCE ALIGNMENTS; SEQUENCING METHOD;

GENES;

EID: 79959927754     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989370     Document Type: Conference Paper

References (23)

1. White House Press Release. Retrieved 2006-07-22. http://www.ornl.gov/sci/ techresources/Human-Genome/project/clinton1.shtml.
2. M.-S. K. 0002, K.-Y. Whang, J.-G. Lee, and M.-J. Lee. n-gram/2l: A space and time efficient two-level n-gram inverted index structure. In VLDB, pages 325-336, 2005.
3. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
4. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
5. R. A. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74-82, 1992.
6. L. Ben, T. Cole, P. Mihai, and S. Steven. Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biology, 10(3):R25, 2009.
7. M. Burrows and D. Wheeler. A block-sorting lossless data compression algorithm. Digital SRC Research Report, 1994.
8. T. Han, S. Ko, and J. Kang. Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index. Machine Learning and Data Mining in Pattern Recognition, pages 585-600, 2007.
9. E. Karakoc, Z. Ozsoyoglu, S. Sahinalp, M. Tasan, and X. Zhang. Novel approaches to biomolecular sequence indexing. Data Engineering, 1001:40, 2004.
10. D. E. Knuth. The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1. Addison-Wesley Professional, Jan. 2011.
11. C. Li, B. Wang, and X. Yang. Vgram: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, pages 303-314, 2007.
12. H. Li, J. Ruan, and R. Durbin. Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome research, 18(11):1851, 2008.
13. R. Li, Y. Li, K. Kristiansen, and J. Wang. SOAP: short oligonucleotide alignment program. Bioinformatics, 24(5):713, 2008.
14. W. Litwin, R. Mokadem, P. Rigaux, and T. J. E. Schwarz. Fast ngram-based string search over data encoded using algebraic signatures. In VLDB, pages 207-218, 2007.
15. J. D. McPherson. Next-generation gap. Nature Methods, 6(11s):S2-S5, October 2009.
16. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
17. P. Papapetrou, V. Athitsos, G. Kollios, and D. Gunopulos. Reference-based alignment in large sequence databases. PVLDB, 2(1):205-216, 2009.
18. J. Rao and K. A. Ross. Cache conscious indexing for decision-support in main memory. In VLDB, pages 78-89, 1999.
19. R. L. Rivest. Partial-match retrieval algorithms. SIAM J. Comput., 5(1):19-50, 1976.
20. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
21. Venter, et al. The Sequence of the Human Genome. Science, 291(5507):1304-1351, 2001.
22. S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83-91, 1992.
23. X. Yang, B. Wang, and C. Li. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In SIGMOD Conference, pages 353-364, 2008.