Speeding up the detection of tandem repeats over the edit distance
DOI10.1016/J.TCS.2013.04.021zbMATH Open1282.68201OpenAlexW2054084157MaRDI QIDQ2437752FDOQ2437752
Authors: Dina Sokol, Justin Tojeira 
Publication date: 13 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.021
Recommendations
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Finding approximate repetitions under Hamming distance.
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- An O(n log n) algorithm for finding all repetitions in a string
- Fast parallel and serial approximate string matching
- Incremental String Comparison
- Title not available (Why is that?)
- Detecting leftmost maximal periodicities
- Fast and Practical Algorithms for Computing All the Runs in a String
- Faster entropy-bounded compressed suffix trees
- New text indexing functionalities of the compressed suffix arrays
- Lempel-Ziv factorization using less time \& space
- Computing longest previous factor in linear time and applications
- A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
- Speeding up the detection of evolutive tandem repeats
Cited In (6)
- Title not available (Why is that?)
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Period recovery of strings over the Hamming and edit distances
- Finding the Position of the k-Mismatch and Approximate Tandem Repeats
- Speeding up the detection of evolutive tandem repeats
- Title not available (Why is that?)
This page was built for publication: Speeding up the detection of tandem repeats over the edit distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437752)
