Lossless seeds for searching short patterns with high error rates

Abstract : We address the problem of approximate pattern matching using the Levenshtein distance. Given a text T and a pattern P , find all locations 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 errors
Type de document :
Communication dans un congrès
International Workshop On Combinatorial Algorithms, Oct 2014, Duluth, United States
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01079840
Contributeur : Mikaël Salson <>
Soumis le : lundi 3 novembre 2014 - 18:00:14
Dernière modification le : vendredi 8 janvier 2016 - 01:06:55

Identifiants

  • HAL Id : hal-01079840, version 1

Citation

Christophe Vroland, Mikaël Salson, Hélène Touzet. Lossless seeds for searching short patterns with high error rates. International Workshop On Combinatorial Algorithms, Oct 2014, Duluth, United States. <hal-01079840>

Partager

Métriques

Consultations de la notice

177