YASS: Similarity search in DNA sequences

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 describe YASS -- a new tool for finding local similarities in DNA sequences. The YASS algorithm first scans the sequence(s) and creates on the fly groups of (small exact repeats obtained by hashing) according to statistically-founded criteria. Then it tries to extend those groups into similarity regions on the basis of a new extension criterion. The method can be seen as a compromise between single-seed () and multiple-seed (, ) approaches, and achieves a gain in both sensitivity and selectivity. The method is flexible and can be made more efficient by using spaced seeds, and in particular transition-constrained spaced seeds. We provide examples of applying YASS to Saccharomyces Cerevisiae and Drosophila Melanogaster chromosomes.
Document type :
Reports
[Research Report] RR-4852, INRIA. 2003, pp.20
Liste complète des métadonnées

https://hal.inria.fr/inria-00071731
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:37:40 PM
Last modification on : Tuesday, October 25, 2016 - 4:57:45 PM
Document(s) archivé(s) le : Sunday, April 4, 2010 - 8:43:08 PM

Identifiers

  • HAL Id : inria-00071731, version 1

Collections

Citation

Laurent Noé, Gregory Kucherov. YASS: Similarity search in DNA sequences. [Research Report] RR-4852, INRIA. 2003, pp.20. <inria-00071731>

Share

Metrics

Record views

223

Document downloads

212