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 Contributor : Publications LoriaConnect in order to contact the contributor Submitted on : Thursday, October 19, 2006 - 9:11:58 AM Last modification on : Friday, February 4, 2022 - 3:31:28 AM Long-term archiving on: : Wednesday, March 29, 2017 - 12:59:20 PM