The approximate period problem for DNA alphabet.

DOI10.1016/S0304-3975(03)00211-1zbMATH Open1045.68084OpenAlexW1992107230MaRDI QIDQ1401415FDOQ1401415

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

NP-completePeriodicityDistance functionApproximate periods

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On covering problems of codes
• Title not available (Why is that?)
• Approximate periods of strings
• Multiple Alignment, Communication Cost, and Graph Matching

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)