scientific article; zbMATH DE number 7651094

DOI10.4230/LIPICS.CPM.2020.3MaRDI QIDQ5874428zbMATH OpenFDO

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

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2020.3

zbMATH Keywords

2-dimensionaldouble stringscaletandem repeat

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Linear time algorithms for finding and representing all the tandem repeats in a string
• scientific article; zbMATH DE number 2185638
• Speeding up the detection of tandem repeats over the edit distance
• Simple and flexible detection of contiguous repeats using a suffix tree
• scientific article; zbMATH DE number 1875416

Cited in

(8)

• Linear time algorithms for finding and representing all the tandem repeats in a string
• Lower bounds for the number of repetitions in 2D strings
• Speeding up the detection of tandem repeats over the edit distance
• Double string tandem repeats
• The number of repetitions in 2D-strings
• A stringy massive double copy
• Two-dimensional Fibonacci words: tandem repeats and factor complexity
• Exact and inexact search for 2d side-sharing tandems

This page was built for publication:

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