Reference-based alignment in large sequence databases

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 205-216

  Papapetrou, Panagiotis ^a   Athitsos, Vassilis ^b   Kollios, George ^a   Gunopulos, Dimitrios ^c,d  

^a BOSTON UNIVERSITY   (United States)

^b The University of Texas at Arlington   (United States)

^c UNIVERSITY OF ATHENS   (Greece)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING;

BIOLOGICAL SEQUENCE ALIGNMENT; EXPERIMENTAL EVALUATION; FALSE DISMISSALS; RETRIEVAL ACCURACY; SIMILARITY MEASURE; STATE OF THE ART; STRING ALIGNMENT; SUBSEQUENCE MATCHES;

ALIGNMENT;

EID: 79959936774     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687651     Document Type: Article

References (44)

1. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
2. S. Altschul, T. Madden, R. Schffer, J.Zhang, Z.Zhang, W.Miller, and D. Lipman. Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Res, 25:3389-3402, 1997.
3. V. Athitsos, P. Papapetrou, M. Potamias, G. Kollios, and D. Gunopulos. Approximate embedding-based subsequence matching of time series. In ACM International Conference on Management of Data (SIGMOD), pages 365-378, 2008.
4. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
5. S. Burkhardt, A. Crauser, P. Ferragina, H.-P. Lenhof, E. Rivals, and M. Vingron. q-gram based database searching using a suffix array (quasar). In International Conference on Computational Molecular Biology (RECOMB), pages 77-83, 1999.
6. S. Burkhardt and J. Kärkkaäinen. Better filtering with gapped q-grams. Fundam. Inf., 56(1,2):51-70, 2002.
7. C. Cao, L. C. Shuai, and A. K. H. Tung. Indexing dna sequences using q-grams. Database Systems for Advanced Applications, 3453:4-16, 2005.
8. X. Cao, B. C. Ooi, A. Tung, H. H. Pang, and K.-L. Tan. DSIM: A distance-based indexing method for genomic sequences. In IEEE Symposium on Bioinformatics and Bioengineering (BIBE), pages 97-104, 2005.
9. W. I. Chang and E. L. Lawler. Sublinear expected time approximate string matching and biological applications. Technical Report CSD-91-654, University of California at Berkeley, 1991.
10. M. Crochemore and T. Lecroq. Pattern matching and text compression algorithms. In ACM Computing Surveys, 1996.
11. E. Giladi, M. G. Walker, J. Z. Wang, and W. Volkmuth. SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size. Bioinformatics, 18(6):873-877, 2002.
12. K. Hamza. The smallest uniform upper bound on the distance between the mean and the median of the binomial and poisson distributions. Statistics and Probability Letters, 23(1):21-25, 1995.
13. X. Huang and K.-M. Chao. A generalized global alignment algorithm. Bioinformatics, 19(2):228-233, 2003.
14. C. V. Jongeneel. Searching the expressed sequence tag (est) databases: Panning for genes. Bioinformatics, 1:76-92, 2000.
15. K. J. Kalafus, A. R. Jackson, and A. Milosavljevic. Pash: Efficient genome-scale sequence anchoring by positional hashing. Genome Resources, 14(4):672678, 2004.
16. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Res. Dev., 31(2):249-260, 1987.
17. W. J. Kent. Resource BLAT-The BLAST-Like Alignment Tool. Genome Research, 2002.
18. M.-S. Kim, 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 International Conference on Very Large Data Bases (VLDB), pages 325-336, 2005.
19. Y. J. Kim, A. Boyd, B. D. Athey, and J. M. Patel. miblast: scalable evaluation of a batch of nucleotide sequence queries with blast. Nucleic Acids Res, 33:4335-4344, 2005.
20. D. E. Knuth. The art of computer programming. Sorting and Searching, 3, 1973.
21. I. Korf and W. Gish. Mpblast : improved blast performance with multiplexed queries. Bioinformatics, 16:1052-1053, 2000.
22. T. W. Lam, W. K. Sung, S. L. Tam, C. Wong, and S. Yiu. Compressed indexing and local alignment of dna. Bioinformatics, 24(6), 2008.
23. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics, 10(8):707-710, 1966.
24. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In IEEE International Conference on Data Engineering (ICDE), pages 257-266, 2008.
25. C. Li, B. Wang, and X. Yang. Vgram: improving performance of approximate queries on string collections using variable-length grams. In International Conference on Very Large Data Bases (VLDB), pages 303-314, 2007.
26. D. J. Lipman and W. R. Pearson. Rapid and sensitive protein similarity searches. Science, 227(4693):1435-1441, March 1985.
27. W. Litwin, R. Mokadem, P. Rigaux, and T. Schwarz. Fast ngram-based string search over data encoded using algebraic signatures. In International Conference on Very Large Data Bases (VLDB), pages 207-218, 2007.
28. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 319-327, 1990.
29. C. Meek, J. M. Patel, and S. Kasetty. Oasis: An online and accurate technique for local-alignment searches on biological sequences. In International Conference on Very Large Data Bases (VLDB), pages 910-921, 2003.
30. G. Myers. Whole-genome dna sequencing. Computing in Science and Engg., pages 33-43, 1999.
31. C. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio. Indexing text with approximate q-grams. In COM '00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pages 350-363, 2000.
32. G. Navarro and R. Baeza-Yates. A new indexing method for approximate string matching. In Combinatorial Pattern Matching, 10th Annual Symposium, pages 163-185, 1999.
33. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal on Molecular Biology, 48(3):443-53, 1970.
34. Z. Ning, A. J. Cox, and J. C. Mullikin. SSAHA: A fast search method for large dna databases. Genome Resources, 11(10):1725-1729, 2001.
35. W. R. Pearson and D. J. Lipman. Improved tools for biological sequence comparison. Proc Natl Acad Sci U S A, 85(8):2444-2448, April 1988.
36. B. Phoophakdee and M. J. Zaki. TRELLIS+: an effective approach for indexing genome-scale sequences using suffix trees. In Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, pages 90-101, 2008.
37. D. E. K. J. Pratt and R. Vaughan. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
38. G. J. Russell and J. H. Subak-Sharpe. Similarity of the general designs of protochordates and invertebrates. Nature, 266:533-536, 1977.
39. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
40. E. Ukkonen. Algorithms for approximate string matching. Information Control, 64(1-3):100-118, 1985.
41. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
42. J. Venkateswaran, D. Lachwani, T. Kahveci, and C. Jermaine. Reference-based indexing of sequence databases. In International Conference on Very Large Databases (VLDB), pages 906-917, 2006.
43. X. Yang, B. Wang, and C. Li. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In ACM International Conference on Management Of Data (SIGMOD), pages 353-364, 2008.
44. Z. Zhang, S. Schwartz, L. Wagner, and W. Miller. A greedy algorithm for aligning dna sequences. Journal of Computational Biology, 7:203-214, 2000.