scientific article; zbMATH DE number 7651094

DOI10.4230/LIPICS.CPM.2020.3MaRDI QIDQ5874428FDOQ5874428

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

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

Recommendations

• Linear time algorithms for finding and representing all the tandem repeats in a string
• scientific article
• 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

zbMATH Keywords

scale2-dimensionaltandem repeatdouble string

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (8)

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

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)