Multi-seed lossless filtration

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

Volumn 3109, Issue , 2004, Pages 297-310

  Kucherov, Gregory ^a   Noé, Laurent ^b   Roytberg, Mikhail ^a  

^a LORIA   (France)

^b INSTITUTE OF MATHEMATICAL PROBLEMS OF BIOLOGY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

OLIGONUCLEOTIDES;

APPROXIMATE STRING MATCHING; COMBINATORIAL PROPERTIES; EXTENDED ABSTRACTS; LARGE-SCALE APPLICATIONS; OLIGONUCLEOTIDE SELECTION; SEQUENCE DATABASE; SIMULTANEOUS USE; SINGLE SEEDS;

PATTERN MATCHING;

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

References (21)

1. Burkhardt, S., Kärkkäinen, J.: Better filtering with gapped q-grams. Fundamenta Informaticae 56 (2003) 51-70 Preliminary version in Combinatorial Pattern Matching 2001.
2. Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press (2002) ISBN 0-521-81307-7. 280 pages.
3. Altschul, S., Madden, T., Schäffer, A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research 25 (1997) 3389-3402
4. Ma, B., Tromp, J., Li, M.: PatternHunter: Faster and more sensitive homology search. Bioinformatics 18 (2002) 440-445
5. Schwartz, S., Kent, J., Smit, A., Zhang, Z., Baertsch, R., Hardison, R., Haussler, D., Miller, W.: Human-mouse alignments with BLASTZ. Genome Research 13 (2003) 103-107
6. Noe, L., Kucherov, G.: YASS: Similarity search in DNA sequences. Research Report RR-4852, INRIA (2003) http://www.inria.fr/rrrt/rr-4852.html.
7. Pevzner, P., Waterman, M.: Multiple filtration and approximate pattern matching. Algorithmica 13 (1995) 135-154
8. Califano, A., Rigoutsos, I.: Flash: A fast look-up algorithm for string homology. In: Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology. (1993) 56-64
9. Buhler, J.: Provably sensitive indexing strategies for biosequence similarity search. In: Proceedings of the 6th Annual International Conference on Computational Molecular Biology (RECOMB02), Washington, DC (USA), ACM Press (2002) 90-99
10. Keich, U., Li, M., Ma, B., Tromp, J.: On spaced seeds for similarity search. Discrete Applied Mathematics (2004) to appear.
11. Buhler, J., Keich, U., Sun, Y.: Designing seeds for similarity search in genomic DNA. In: Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB03), Berlin (Germany), ACM Press (2003) 67-75
12. Brejova, B., Brown, D., Vinar, T.: Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. In Benson, G., Page, R., eds.: Proceedings of the 3rd International Workshop in Algorithms in Bioinformatics (WABI), Budapest (Hungary). Volume 2812 of Lecture Notes in Computer Science., Springer (2003) 39-54
13. Kucherov, G., Noe, L., Ponty, Y.: Estimating seed sensitivity on homogeneous alignments. In: Proceedings of the IEEE 4th Symposium on Bioinformatics and Bioengineering (BIB E2004), May 19-21, 2004, Taichung (Taiwan), IEEE Computer Society Press (2004) to appear.
14. Choi, K., Zhang, L.: Sensitivity analysis and efficient method for identifying optimal spaced seeds. Journal of Computer and System Sciences (2003) to appear.
15. Li, F., Stormo, G.: Selection of optimal DNA oligos for gene expression arrays. Bioinformatics 17 (2001) 1067-1076
16. Kaderali, L., Schliep, A.: Selecting signature oligonucleotides to identify organisms using DNA arrays. Bioinformatics 18 (2002) 1340-1349
17. Rahmann, S.: Fast large scale oligonucleotide selection using the longest common factor approach. Journal of Bioinformatics and Computational Biology 1 (2003) 343-361
18. Zheng, J., Close, T., Jiang, T., Lonardi, S.: Efficient selection of unique and popular oligos for large est databases. In: LNCS 2676, Proceedings of Symposium on Combinatorial Pattern Matching (CPM'03), Springer (2003) 273-283
19. Burkhardt, S., Karkkainen, J.: One-gapped q-gram filters for Levenshtein Distance. In: Proceedings of the 13th Symposium on Combinatorial Pattern Matching (CPM'02). Volume 2373., Springer (2002) 225-234
20. Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: Highly sensitive and fast homology search. Journal of Bioinformatics and Computational Biology (2004) Earlier version in GIW 2003 (International Conference on Genome Informatics).
21. Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. In: Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), ACM Press (2004)