Lossless seeds for searching short patterns with high error rates

Vroland, Christophe; Salson, Mikael; Touzet, Helene

Document type :

Communication dans un congrès avec actes

Title :

Lossless seeds for searching short patterns with high error rates

Author(s) :

Vroland, Christophe [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Bioinformatics and Sequence Analysis [BONSAI]
Génétique et évolution des populations végétales [GEPV]
Salson, Mikael [Auteur]

Bioinformatics and Sequence Analysis [BONSAI]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Touzet, Helene [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Bioinformatics and Sequence Analysis [BONSAI]

Conference title :

International Workshop On Combinatorial Algorithms

City :

Duluth

Country :

Etats-Unis d'Amérique

Start date of the conference :

2014-10

HAL domain(s) :

Informatique [cs]/Algorithme et structure de données [cs.DS]

English abstract : [en]

We address the problem of approximate pattern matching using the Levenshtein distance. Given a text T and a pattern P , find alllocations in T that differ by at most k errors from P . For that purpose, we propose a filtration ...
Show more >We address the problem of approximate pattern matching using the Levenshtein distance. Given a text T and a pattern P , find alllocations in T that differ by at most k errors from P . For that purpose, we propose a filtration algorithm that is based on a novel type of seeds,combining exact parts and parts with a fixed number of errors. Experimental tests show that the method is specifically well-suited for short patterns with a large number of errorsShow less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :