Abstract : In this paper we describe an implementation of Main-Kolpakov-Kucherov algorithm \cite{KolpakovKucherovFOCS99} of linear-time search for maximal repetitions in sequences. We first present a theoretical background and sketch main components of the method. We also discuss how the method can be generalized to finding approximate repetitions. Then we discuss implementation decisions and present test examples of running the programs on real DNA data.
https://hal.inria.fr/inria-00107854
Contributeur : Publications Loria
<>
Soumis le : jeudi 19 octobre 2006 - 09:11:58
Dernière modification le : mardi 6 mars 2018 - 17:40:58
Document(s) archivé(s) le : mercredi 29 mars 2017 - 12:59:20
