Locating All Maximal Approximate Runs in a String

DOI10.1007/978-3-642-38905-4_4zbMath1381.68309OpenAlexW2239938932MaRDI QIDQ4928555

Maxime Crochemore, Gad M. Landau, Mika Amit

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01798044/file/paper_18.pdf

zbMATH Keywords

pattern matchingrepetitionstandem repeatsrunsalgorithms on strings

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Multidimensional period recovery ⋮ Period recovery of strings over the Hamming and edit distances