The approximate period problem for DNA alphabet.

DOI10.1016/S0304-3975(03)00211-1zbMath1045.68084OpenAlexW1992107230MaRDI QIDQ1401415

D. Massart

Publication date: 17 August 2003

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

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

zbMATH Keywords

NP-completePeriodicityDistance functionApproximate periods

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Period recovery of strings over the Hamming and edit distances

Cites Work

• Unnamed Item
• On covering problems of codes
• Multiple Alignment, Communication Cost, and Graph Matching
• Approximate periods of strings