Superiority and complexity of the spaced seeds

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 444-453

  Li, Ming ^a,b   Ma, Bin ^c   Zhang, Louxin ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; BIOTECHNOLOGY; COMPUTER SCIENCE; COMPUTER SIMULATION; PROBABILITY; QUERY LANGUAGES;

BIOINFORMATICS; HOMOLOGY; QUERIES; SPACED SEEDS;

SEED;

SEEDS;

EID: 33244486495     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109607     Document Type: Conference Paper

References (37)

1. S.F. Altschul et al., Basic local alignment search tool, J. Mol. Biol. 215(1990), pp. 403-410.
2. S.F. Altschul et al., Gapped Blast and Psi-Blast: a new generation of protein database search programs, Nucleic Acids Res. 25(1997), pp. 3389-3402.
3. N. Balakrishnan and M.V. Koutras, Runs and Scans with Applications, John Wiley & Sons, U.S.A., 2002.
4. G. Birkhoff, Extension of Jentzsch's theorem, Trans. Amer. Math. Soc. 85(1957), pp. 219-227.
5. B. Brejovà, D. Brown, and T. Vinař, Optimal spaced seeds for homologous coding regions. J. Bioinf. and Comp. Biol. 1(2004), pp. 595-610.
6. Early version appeared in CPM 2003.
7. J. Buhler, U. Keich, and Y. Sun, Designing seeds for similarity search in genomic DNA. Proc. 7th Annual Int'l Conf. on Comput. Mol. Biol. (RECOMB'03), pp. 67-75, Berlin, Germany.
8. K.P. Choi, and L. Zhang, Sensitivity analysis and efficient method for identifying optimal spaced seeds, J. Comput. Sys. Sci., 68(2004), pp. 22-40.
9. K.P. Choi, F. Zeng, and L. Zhang, Good Spaced Seeds for Homology Search, Bioinformatics 20(2004), pp. 1053-1059.
10. W. Feller, An introduction to Probability Theory and its Applications, Vol. I (3rd edition), Wiley, New York.
11. F. Nicolas, and E. Rivals, Hardness of Optimal Spaced Seed Designi, Proc. 16th Annual Symposium Combinatorial Pattern Matching (CPM'05), 2005, pp. 144-155.
12. M. Garey, and D. Johnson, A guide to the theory of NP-completeness, W.H. Freeman, 1979.
13. V. Gotea, V. Veeramachaneni, and W. Makalowski, Mastering seeds for genomic size nucleotide BLAST searches, Nucleic Acids Res. 31(2003), pp. 6935-6941.
14. L.J. Guibas and A.M. Odlyzko, String overlaps, pattern matching, and nontransitive games, J. of Combin. Theory (series A) 30(1981), pp. 183-208.
15. Int'l Mouse Genome Sequencing Consortium, Initial sequencing and comparative analysis of the mouse genome. Nature 409(2002), pp. 520-562.
16. P. Jacquet and W. Szpankowski, Analytic Approach to Pattern Matching, In Applied Combinatorics on Words (Editor: M. Lothaire), Cambridge Press, 2005.
17. U. Keich, M. Li, B. Ma, and J. Tromp, On Spaced Seeds for Similarity Search, Discrete Appl. Math. 3(2004), pp. 253-263.
18. G. Kucherov, L. Noe, and Y. Ponty, Estimating seed sensitivity on homogeneous alignments, In Proc. IEEE 4th Symp. on Bioinformatics and Bioengineering, Taiwan, 2004, pp. 387-394.
19. M. Li, B. Ma, and L. Wang, On the Closest String and Substring Problems, Journal of the ACM 49(2002), pp. 157-171.
20. M. Li, B. Ma, D. Kisman, and J. Tromp, PatternHunterII: highly sensitive and fast homology search. J. Bioinformatics and Comput. Biol. 2(2004), pp. 417-440.
21. D.J. Lipman and W.R. Pearson, Rapid and sensitive protein similarity searches, Science 227(1985), pp. 1435-1441.
22. B. Ma, J. Tromp, and M. Li, PatternHunter: faster and more sensitive homology search, Bioinformatics, 18(2002), pp. 440-445.
23. S.R. Mahaney, Sparse complete sets for NP: soluton of a conjecture of Berman and Hartmanis, J. Comput. System Sci. 25(1982), pp. 130-143.
24. H. Mine, Nonnegative matrices, John Wiley and Sons, New York, 1988.
25. National Center for Biotechnology Information. Growth of GenBank, 2002.
26. S.B. Needleman and C.D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Biol. 48(1970), pp. 443-453.
27. P. Nicodéme, B. Salvy, and P. Flajolet, Motif Satistics. Lecture Notes in Computer Sciences, vol. 1643, 1999, pp. 194-211.
28. F.P. Preparata, L. Zhang, and K.P. Choi, Quick, practical selection of effective seeds for homology search, To appear in J. Comput. Biology, 2005.
29. G. Reinert, S. Schbath, and M. Waterman, Probabilistic and statistical properties of words: An overview, J. Comput. Biol. 7(2000), 1-46.
30. S. Schwartz et al. Human-Mouse alignment with BLASTZ, Genome Res. 13(2003), pp. 103-107.
31. T.F. Smith and M.S. Waterman, Identification of common molecular subsequences, J. Mol. Biol. 147 (1981), pp. 195-197.
32. A.D. Solov'ev, A combinatorial identity and its application to the problem concerning the first occurences of a rare event, Theory of Probab. and Appl. 11(1966), pp. 276-282.
33. Y. Sun and J. Buhler, Designing multiple simultaneous seeds for DNA similarity search, in Proc. of RECOMB'04, 2004, pp. 76-85.
34. J. Xu, D. Brown, M. Li, and B. Ma, Optimizing multiple spaced seeds for homology search, In Proc. of CPM'04, LNCS, vol. 3109, pp. 47-58.
35. Final version to appear in J. Comp. Biol.
36. I.-H. Yang et al. Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds, In Proc. IEEE 4th Symp. on Bioinformatics and Bioengineering, Taiwan, 2004, pp. 411-418.
37. Z. Zhang, S. Schwartz, L. Wagner, and W. Miller, A greedy algorithm for aligning DNA sequences. J. Comput. Biology. 7(2000), pp. 203-214.