YASS : Enhancing the sensitivity of DNA similarity search

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 : We present YASS -- a new tool for computing local similarities in DNA sequences. Similar to many existent algorithms (e.g. BLAST), YASS first searches for small patterns (``seeds'') shared by input sequences and then extends some of those (``hits'') into larger alignments. New features of YASS include, on the one hand, a new transition-constrained seed model and, on the other hand, a flexible group criterion of forming hits out of individual seeds. Computer experiments confirm that the program achieves a good sensitivity/selectivity trade-off compared to existing programs, which makes of YASS an efficient tool for comparing long DNA sequences, such as eukaryotic chromosomes.
Type de document :
Communication dans un congrès
Proceedings of the 4th International conference on Bioinformatics of Genome Regulation and Structure - BGRS'2004, 2004, Novosibirsk, Russia, 2, pp.289-292, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00100004
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:17
Dernière modification le : mardi 6 mars 2018 - 17:40:55

Identifiants

  • HAL Id : inria-00100004, version 1

Collections

Citation

Laurent Noé, Gregory Kucherov. YASS : Enhancing the sensitivity of DNA similarity search. Proceedings of the 4th International conference on Bioinformatics of Genome Regulation and Structure - BGRS'2004, 2004, Novosibirsk, Russia, 2, pp.289-292, 2004. 〈inria-00100004〉

Partager

Métriques

Consultations de la notice

141