Rime: Repeat identification

Abstract : We present an algorithm for detecting long similar fragments occurring at least twice in a set of biological sequences. The problem becomes computationally challenging when the frequency of a repeat is allowed to increase and when a non-negligible number of insertions, deletions and substitutions are allowed. We introduce in this paper an algorithm, Rime1 (for Repeat Identification: long, Multiple, and with Edits) that performs this task, and manages instances whose size and combination of parameters cannot be handled by other currently existing methods. This is achieved by using a filter as a preprocessing step, and by then exploiting the information gathered by the filter in the following actual repeat inference step. To the best of our knowledge, Rime is the first algorithm that can accurately deal with very long repeats (up to a few thousands), occurring possibly several times, and with a rate of differences (substitutions and indels) allowed among copies of a same repeat of 10-15% or even more.
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

Contributeur : Pierre Peterlongo <>
Soumis le : jeudi 29 juin 2017 - 09:20:09
Dernière modification le : jeudi 7 février 2019 - 14:52:35
Document(s) archivé(s) le : jeudi 18 janvier 2018 - 01:54:20


Fichiers produits par l'(les) auteur(s)



Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot. Rime: Repeat identification. Discrete Applied Mathematics, Elsevier, 2014, 163 (3), pp.275-286. 〈10.1016/j.dam.2013.02.016〉. 〈hal-00802023〉



Consultations de la notice


Téléchargements de fichiers