Ordered Index Seed Algorithm for Intensive DNA Sequence Comparison - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Ordered Index Seed Algorithm for Intensive DNA Sequence Comparison

Résumé

This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments -- or HSPs (High Scoring Pairs) - in the first stage of the search. W-nt words are first indexed and all the 4^W possible seeds are enumerated following a strict order ensuring fast generation of unique HSPs. A prototype - written in C - has been realized and tested on large DNA banks. Speed-up compared to BLASTN range from 5 to 28 with comparable sensitivity.
Fichier principal
Vignette du fichier
lavenier_1569087275.pdf (80.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00322696 , version 1 (18-09-2008)

Identifiants

  • HAL Id : hal-00322696 , version 1

Citer

Dominique Lavenier. Ordered Index Seed Algorithm for Intensive DNA Sequence Comparison. HiCOMB 2008 : Seventh IEEE International Workshop on High Performance Computational Biology, Apr 2008, Miami, United States. online proceeding : http://www.hicomb.org/HiCOMB2008/. ⟨hal-00322696⟩
131 Consultations
269 Téléchargements

Partager

Gmail Facebook X LinkedIn More