YASS: Similarity search in DNA sequences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

YASS: Similarity search in DNA sequences

Laurent Noé


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4852.pdf (339.47 Ko) Télécharger le fichier

Dates and versions

inria-00071731 , version 1 (23-05-2006)


  • HAL Id : inria-00071731 , version 1


Laurent Noé, Gregory Kucherov. YASS: Similarity search in DNA sequences. [Research Report] RR-4852, INRIA. 2003, pp.20. ⟨inria-00071731⟩
165 View
237 Download


Gmail Facebook Twitter LinkedIn More