Improved hit criteria for DNA local alignment

BMC Bioinformatics

Volumn 5, Issue , 2004, Pages

  Noé, Laurent ^a   Kucherov, Gregory ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC IDEAS; ANALYTICAL DATA; HEURISTIC LOCAL ALIGNMENT; LOCAL ALIGNMENT; SELECTIVITY AND SENSITIVITY; SIMILARITY SEARCH; SPACED SEEDS; TWO WAYS;

HEURISTIC ALGORITHMS;

DNA; BACTERIAL DNA; FUNGAL DNA;

ALGORITHM; ARTICLE; BASE MISPAIRING; COMPUTER PROGRAM; CONTROLLED STUDY; DNA SEQUENCE; HUMAN; INTERMETHOD COMPARISON; INTERNET; MATHEMATICAL COMPUTING; NONHUMAN; NUCLEIC ACID BASE SUBSTITUTION; PROBABILITY; SCORING SYSTEM; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; TIME; ANIMAL; COMPARATIVE STUDY; DROSOPHILA; GENETICS; NEISSERIA MENINGITIDIS; PROCEDURES; SACCHAROMYCES CEREVISIAE; STANDARDS; STATISTICAL MODEL; X CHROMOSOME;

ALGORITHMS; ANIMALS; CHROMOSOMES, HUMAN, X; DNA; DNA, BACTERIAL; DNA, FUNGAL; DROSOPHILA; HUMANS; MARKOV CHAINS; MODELS, STATISTICAL; NEISSERIA MENINGITIDIS; SACCHAROMYCES CEREVISIAE; SEQUENCE ALIGNMENT;

EID: 13244251074     PISSN: 14712105     EISSN: None     Source Type: Journal    
DOI: 10.1186/1471-2105-5-149     Document Type: Article

References (26)

1. Smith T, Waterman M: Identification of common molecular subsequences. Journal of Molecular Biology 1981, 147: 95-197.
2. Lipman D, Pearson W: Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 1988, 85: 444-2448.
3. Altschul S, Gish W, Miller W, Myers E, Lipman D: Basic Local Alignment Search Tool. Journal of Molecular Biology 1990, 215:403-410.
4. 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 1997, 25(17):3389-3402.
5. Kent WJ: BLAT - The BLAST-Like Alignment Tool. Genome Research 2002, 12:656-664.
6. Ma B, Tromp J, Li M: PatternHunter: Faster and more sensitive homology search. Bioinformatics 2002, 18(3): 40-445.
7. Brudno M, Do C, Cooper G, Kim M, Davydov E, Green E, Sidow A, Batzoglou S: LAGAN and Multi-LAGAN: Efficient Tools for Large-Scale Multiple Alignment of Genomic DNA. Genome Research 2003, 13: -11.
8. Schwartz S, Kent J, Smit A, Zhang Z, Baertsch R, Hardison R, Haussler D, Miller W: Human-Mouse Alignments with BLASTZ. Genome Research 2003, 13:103-107.
9. Brejova B, Brown D, Vinar T: Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. In Proceedings of the 3rd International Workshop in Algorithms in Bioinformatics (WABI), Budapest (Hungary), Volume 2812 of Lecture Notes in Computer Science Edited by: Benson G, Page R. Springer; 2003:39-54.
10. Noe L, Kucherov G: Similarity search in DNA sequences. Research Report RR-4852 2003 [http://www.inria.fr/rrrt/rr-4852.html]. INRIA
11. Kucherov G, Noé L, Ponty Y: Estimating seed sensitivity on homogeneous alignments. In Proceedings of the IEEE 4th Symposium on Bioinformatics and Bioengineering (BIBE2004), May 19-21, Taichung (Taiwan), the IEEE 4th Symposium on Bioinformatics and Bioengineering - BIBE'2004 IEEE Computer Society Press; 2004:387-394.
12. Burkhardt S, Kärkkäinen J: Better Filtering with Gapped q-Grams. Fundamenta Informaticae 2003, 56(1-2): 1-70. [Preliminary version in Combinatorial Pattern Matching 2001]
13. Pevzner P, Waterman M: Multiple Filtration and Approximate Pattern Matching. Algorithmica 1995, 13:135-154.
14. 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.
15. Buhler J: Efficient Large-Scale Sequence Comparison by Locality-Sensitive Hashing. Bioinformatics 2001, 17(5): 19-428.
16. Keich U, Li M, Ma B, Tromp J: On Spaced Seeds for Similarity Search. 2002. [Manuscript]
17. Brejova B, Brown D, Vinar T: Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. In Proceedings of the 14th Symposium on Combinatorial Pattern Matching, Volume 2676 of Lecture Notes in Computer Science Edited by: Baeza-Yates R, E Chavez MC. Springer; 2003:42-54.
18. 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.
19. Choi K, Zhang L: Sensitivity Analysis and Efficient Method for Identifying Optimal Spaced Seeds. Journal of Computer and System Sciences 2004, 68:22-40.
20. Choi KP, Zeng F, Zhang L: Good Spaced Seeds For Homology Search. Bioinformatics 2004, 20:1053-1059.
21. Chiaromonte F, Yap V, Miller W: Scoring Pairwise Genomic Sequence Alignments. Pac Symp Biocomput 2002, 7:115-126.
22. Li M, Ma B, Kisman D, Tromp J: PatternHunter II: Highly Sensitive and Fast Homology Search. J Bioinform Comput Biol 2004:417-439.
23. Sun Y, Buhler J: Designing Multiple Simultaneous Seeds for DNA Similarity Search. In In Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004) ACM Press; 2004:76-84.
24. Kucherov G, Noé L, Roytberg M: Multi-seed lossless filtration. In In Proceedings of the 15th Annual Combinatorial Pattern Matching Symposium (CPM), Istanbul (Turkey), Volume 3109 of Lecture Notes in Computer Science Edited by: Sahinalp S, Muthukrishnan S, Dogrusoz U. Springer Verlag; 2004:297-310.
25. Aki S, Kuboki H, Hirano K: On discrete distributions of order k. Annals of the Institute of Statistical Mathematics 1984, 36:431-440.
26. Benson G: Tandem repeats finder: a program to analyse DNA sequences. Nucleic Acids Research 1999, 27(2):573-580.