Optimizing Multiple Spaced Seeds for Homology Search

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

Volumn 3109, Issue , 2004, Pages 47-58

  Xu, Jinbo ^a   Brown, Daniel G ^a   Li, Ming ^a   Bin, Ma ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; PATTERN MATCHING;

GREEDY ALGORITHMS; HOMOLOGOUS SEQUENCES; HOMOLOGY SEARCH; MATHEMATICAL FOUNDATIONS; MULTIPLE SEEDS; MULTIPLE SPACED SEEDS; PERFORMANCE GUARANTEES; SENSITIVITY AND SPECIFICITY;

ALGORITHMS;

EID: 35048881469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_4     Document Type: Article

References (13)

1. B. Ma, J. Tromp, and M. Li. Patternhunter: Faster and more sensitive homology search. Bioinfomatics, 18:440-445, 2002.
2. Jeremy Buhler, Uri Keich, and Yanni Sun. Designing seeds for similarity search in genomic DNA. In Proceedings of the Seventh Annual International Conference on Computational Molecular Biology (RECOMB03), pages 67-75, Berlin, Germany, April 2003.
3. Ming Li, Bin Ma, Derek Kisman, and John Tromp. Patternhunter II: Highly sensitive and fast homology search. Journal of Bioinformatics and Computational Biology, 2004. In Press.
4. Brona Brejova, Daniel Brown, and Tomas Vinar. Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. In G. Benson and R. Page, editors, Algorithms and Bioinformatics: 3rd International Workshop (WABI), volume 2812 of Lecture Notes in Bioinformatics, pages 39-54, Budapest, Hungary, September 2003. Springer.
5. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
6. Uri Keich, Ming Li, Bin Ma, and John Tromp. On spaced seeds for similarity search. Discrete Applied Mathematics, 2004. In Press.
7. Kwok Pui Choi and Louxin Zhang. Sensitivity analysis and efficient method for identifying optimal spaced seeds. Journal of Computer and System Sciences, 68:22-40, 2004.
8. Brona Brejova, Daniel G. Brown, and Tomas Vinar. Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. In R. Baeza-Yates, E. Chavez, and M. Crochemore, editors, Combinatorial Pattern Matching, 14th Annual Symposium (CPM), volume 2676 of Lecture Notes in Computer Science, pages 42-54, Morelia, Mexico, June 25-27 2003. Springer.
9. T.F. Smith and M.S. Waterman. Identification common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
10. Dorit S. Hochbaum. Approximating covering and packing problems:set cover, vertex cover, independent set, and related problems. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 3, pages 135-137. PWS, 1997.
11. Uriel Feige. A threshold of Inn for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
12. R. Motwani and P. Raghavan. Randomized Algorithm. Cambridge University Press, New York, 1995.
13. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, October 1988.