Locating all maximal approximate runs in a string

DOI10.1007/978-3-642-38905-4_4MaRDI QIDQ4928555zbMATH OpenOpenAlexFDO

Authors Mika Amit, Maxime Crochemore, Gad M. Landau

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

algorithms on stringspattern matchingrepetitionsrunstandem repeats

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Locating maximal approximate runs in a string
• How many runs can a string contain?
• The number of runs in a string
• Fast and Practical Algorithms for Computing All the Runs in a String
• The ``runs theorem

Cited in

(4)

• Period recovery of strings over the Hamming and edit distances
• Multidimensional period recovery
• Locating maximal approximate runs in a string
• Exact and inexact search for 2d side-sharing tandems

This page was built for publication: Locating all maximal approximate runs in a string

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928555)