@inproceedings{91ebb59402064663a4914cb58e2e5d7f,

title = "Locating all maximal approximate runs in a string",

abstract = "An exact run in a string, T, is a non-empty substring of T that can be divided into adjacent non-overlapping identical substrings. Finding exact runs in strings is an important problem and therefore a well studied one in the strings community. For a given string T of length n, finding all maximal exact runs in the string can be done in O(n logn) time or O(n) time on integer alphabets. In this paper, we investigate the maximal approximate runs problem: for a given string T and a number k, find every non-empty substring T′ of T such that changing at most k letters in T′ transforms it into a maximal exact run in T. We present an O(nk2 log k log n/k) algorithm.",

keywords = "algorithms on strings, pattern matching, repetitions, runs, tandem repeats",

author = "Mika Amit and Maxime Crochemore and Landau, {Gad M.}",

year = "2013",

doi = "10.1007/978-3-642-38905-4_4",

language = "English",

isbn = "9783642389047",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "13--27",

booktitle = "Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings",

note = "24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013 ; Conference date: 17-06-2013 Through 19-06-2013",

}