A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies

Fichier non déposé

Dates et versions

hal-00474816 , version 1 (21-04-2010)

Identifiants

  • HAL Id : hal-00474816 , version 1

Citer

L. Mouchard, C.S. Iliopoulos, Solon Pissis. A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. International Conference on Parallel Computing, 2009, France. In press. ⟨hal-00474816⟩
28 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More