✦ LIBER ✦

The approximate period problem for DNA alphabet

✍ Scribed by V.Y. Popov

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 102 KB
Volume: 304
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00211-1

No coin nor oath required. For personal study only.

✦ Synopsis

We show that the approximate period problem for DNA alphabet is NP-complete.

📜 SIMILAR VOLUMES

Approximate algorithms for the travellin

Approximate algorithms for the travelling purchaser problem

✍ Hoon Liong Ong 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Approximate solutions for the cutting st

Approximate solutions for the cutting stock ‘portfolio’ problem

✍ Douglas D. Gemmill; Jerry L. Sanders 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 650 KB

The problem of the approximate calculati

The problem of the approximate calculation for molecular conductance

✍ Feng Yu-Guo 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 506 KB

The current approximate calculations used for molecular conductance have been reviewed and, based on Oatley's assumption'\*2 a set of further equations has been presented.

The inverse problem for periodic potenti

The inverse problem for periodic potentials

✍ E. Trubowitz 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 1 views

A new heuristic for the period traveling

A new heuristic for the period traveling salesman problem

✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 668 KB

An approximate solution method for the f

An approximate solution method for the fixed charge problem

✍ L. Cooper; C. Drebes 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB