Speeding up the detection of evolutive tandem repeats

DOI10.1016/S0304-3975(03)00423-7zbMath1071.68088OpenAlexW1981092387MaRDI QIDQ1884977

Richard Groult, Laurent Mouchard, Martine Léonard

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00423-7

zbMATH Keywords

Hamming distanceDNA sequencesEvolutive tandem repeats

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20)

Related Items (3)

Locating maximal approximate runs in a string ⋮ Period recovery of strings over the Hamming and edit distances ⋮ Speeding up the detection of tandem repeats over the edit distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Normal forms of quasiperiodic strings
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Covering a string
• An O(n log n) algorithm for finding all repetitions in a string

This page was built for publication: Speeding up the detection of evolutive tandem repeats