The approximate period problem for DNA alphabet.

DOI10.1016/S0304-3975(03)00211-1MaRDI QIDQ1401415zbMATH OpenOpenAlexFDO

Authors 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

Approximate periodsDistance functionNP-completePeriodicity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Approximate periods of strings
• scientific article; zbMATH DE number 1305456 (Why is no real title available?)
• Multiple Alignment, Communication Cost, and Graph Matching
• On covering problems of codes

Cited in

(1)

• Period recovery of strings over the Hamming and edit distances

This page was built for publication: The approximate period problem for DNA alphabet.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401415)