scientific article; zbMATH DE number 7651094
From MaRDI portal
Publication:5874428
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)- Exact and inexact search for 2d side-sharing tandems
- Speeding up the detection of tandem repeats over the edit distance
- scientific article; zbMATH DE number 7651171 (Why is no real title available?)
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Two-dimensional Fibonacci words: tandem repeats and factor complexity
- A stringy massive double copy
- Double string tandem repeats
- Lower bounds for the number of repetitions in 2D strings
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)