Improved hit criteria for DNA local alignment.

Laurent Noé 1 Gregory Kucherov 1
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : BACKGROUND: The hit criterion is a key component of heuristic local alignment algorithms. It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisive for the selectivity and sensitivity of the whole method. RESULTS: In this paper, we propose two ways to improve the hit criterion. First, we define the group criterion combining the advantages of the single-seed and double-seed approaches used in existing algorithms. Second, we introduce transition-constrained seeds that extend spaced seeds by the possibility of distinguishing transition and transversion mismatches. We provide analytical data as well as experimental results, obtained with the YASS software, supporting both improvements. CONCLUSIONS: Proposed algorithmic ideas allow to obtain a significant gain in sensitivity of similarity search without increase in execution time. The method has been implemented in YASS software available at
Liste complète des métadonnées
Contributeur : Laurent Noé <>
Soumis le : lundi 25 janvier 2010 - 19:22:47
Dernière modification le : mardi 6 mars 2018 - 17:40:55

Lien texte intégral




Laurent Noé, Gregory Kucherov. Improved hit criteria for DNA local alignment.. BMC Bioinformatics, BioMed Central, 2004, 5 (149), pp.1-9. 〈〉. 〈10.1186/1471-2105-5-149〉. 〈inria-00448743〉



Consultations de la notice