Double string tandem repeats

DOI10.1007/s00453-022-01016-9OpenAlexW4291002597MaRDI QIDQ2700385

Shoshana Marcus, Ayelet Butman, Dina Sokol, Amihood Amir, Gad M. Landau

Publication date: 21 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01016-9

zbMATH Keywords

tandem repeat2d corner sharing tandemdouble stringscaled tandem repeat

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Scaled and permuted string matching
• A fast algorithm for finding the positions of all squares in a run-length encoded string
• Repetitions in strings: algorithms and combinatorics
• Fast string matching with k differences
• A characterization of the squares in a Fibonacci string
• Real scaled matching
• Finding maximal 2-dimensional palindromes
• On-line construction of suffix trees
• Optimal discovery of repetitions in 2D
• Fast Algorithms for Finding Nearest Common Ancestors
• An O(n log n) algorithm for finding all repetitions in a string
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item

This page was built for publication: Double string tandem repeats