Gapped local similarity search with provable guarantees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3240, Issue , 2004, Pages 74-86

  Narayanan, Manikandan ^a   Karp, Richard M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS;

AVERAGE CASE PERFORMANCE; HIGH-DIMENSIONAL; LOCAL SIMILARITY; LONG SEQUENCES; PATTERN DATABASE; SIMILARITY SEARCH; SUFFIX-TREES; WORST CASE INPUTS;

DYNAMIC PROGRAMMING;

EID: 35048835693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30219-3_7     Document Type: Article

References (32)

1. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215(3):403-410, 1990.
2. A. Borodin, R. Ostrovsky, and Y. Rabani. Subquadratic approximation algorithms for clustering problems in high dimensional spaces. In Proc. 31st Symp. on Theory of Computing, pages 435-444, 1999.
3. N. Bray, I. Dubchak, and L. Pachter. Avid: A global alignment program. Genome Research, 13(1):97-102, 2003.
4. B. Brejova, D. Brown, and T. Vinar. Vector seeds: An extension to spaced seeds allows substantial improvements in sensitivity and specifity. In Proc. 3rd Workshop on Algorithms in Bioinformatics, volume 2812 of LNCS, pages 39-54, 2003.
5. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proc. 30th Symp. on Theory of Computing, pages 327-336, 1998.
6. A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic clustering of the web. In Proc. 6th Intl. World Wide Web Conf., pages 391-404, 1997.
7. M. Brudno and B. Morgenstern. Fast and sensitive alignment of large genomic sequences. In Proc. IEEE Comp. Soc. Bioinformatics Conf., pages 138-147, 2002.
8. J. Buhler. Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics, 17(5):419-428, 2001.
9. J. Buhler. Search Algorithms for Biosequences Using Random Projection. PhD thesis, University of Washington, 2001.
10. S. Burkhardt, A. Crauser, P. Ferragina, H. Lenhof, E. Rivals, and M. Vingron. q-gram based database searching using a suffix array. In Proc. 3rd Conf. on Research in Comp. Molecular Biology, pages 77-83, 1999.
11. S. Burkhardt and J. Karkkainen. Better filtering with gapped q-grams. In Proc. 12th Symp. on Comb. Pattern Matching, pages 73-85, 2001.
12. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441-453, 1997.
13. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE Trans. on Knowledge and Data Engineering, 13(1):64-78, 2001.
14. K. Fredriksson and G. Navarro. Improved single and multiple approximate string matching. In 15th Symp. on Comb. Pattern Matching (to appear), 2004.
15. D. Gusfield. Algorithms on Strings, Trees, and Sequences, chapter 11.6.5 (Approximate occurrences of P in T). Cambridge Univ. Press, 1997.
16. T. Haveliwala, A. Gionis, and P. Indyk. Scalable techniques for clustering the web. In Proc. 3rd Intl. Workshop on the Web and Databases, 2000.
17. P. Indyk. A small approximately min-wise independent family of hash functions. In Proc. 10th Symp. on Discrete Algorithms, pages 454-456, 1999.
18. P. Indyk. Nearest neighbors in high-dimensional spaces. In Handbook of Discrete and Comp. Geometry, 2nd Edition. CRC Press LLC, Upcoming.
19. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th Symp. on Theory of Computing, pages 604-613, 1998.
20. R. Karp, O. Waarts, and G. Zweig. The bit vector intersection problem. In Proc. 36th Symp. on Foundations of Computer Science, pages 621-630, 1995.
21. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proc. 30th Symp. on Theory of Computing, pages 614-623, 1998.
22. G. Landau and U. Vishkin. Introducing efficient parallelism into approximate string matching and a new serial algorithm. In Proc. 18th Symp. on Theory of Computing, pages 220-230, 1986.
23. R. Lippert, X. Zhao, L. Florea, C. Mobarry, and S. Istrail. Finding anchors for genomic sequence comparison. In Proc. 8th Conf. on Research in Comp. Molecular Biology, pages 233-241, 2004.
24. S. Muthukrishnan and S. Sahinalp. Simple and practical sequence nearest neighbors with block operations. In Proc. 13th Symp. on Comb. Pattern Matching, pages 262-278, 2002.
25. E. Myers. An O(ND) Difference Algorithm and Its Variations. Algorithmica, 1(2):251-266, 1986.
26. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
27. P. Pevzner. Statistical distance between texts and filtration methods in sequence comparison. CABIOS, 8(2):121-127, 1992.
28. S. Schwartz, W. Kent, A. Smit, Z. Zhang, R. Baertsch R, R. Hardison, D. Haussler, and W. Miller. Human-mouse alignments with blastz. Genome Research, 13(1):103-107, 2003.
29. T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195-197, 1981.
30. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proc. European Symp. on Algorithms, pages 327-340, 1995.
31. E. Ukkonen. Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 92(1):191-211, 1992.
32. NCBI Entrez Genomes. http://www.ncbi.nln.nih.gov/entrez/query.fcgi?db=: Genome.