Molecular solution to the optimal linear arrangement problem based on DNA computation

DOI10.1007/S10910-007-9299-6zbMath1348.92058OpenAlexW2084684938MaRDI QIDQ937692

Xiaofan Yang, Xingchang Liu, Yuan Yan Tang

Publication date: 15 August 2008

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-007-9299-6

zbMATH Keywords

NP-hardnessDNA computationoptimal linear arrangement problemDNA algorithmAdleman-Lipton-sticker model

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA models and algorithms for NP-complete problems
• Efficient DNA sticker algorithms for NP-complete graph problems
• Linear constructions for DNA codes
• Strand design for biomolecular computation.
• On Bipartite Drawings and the Linear Arrangement Problem
• Linear placement algorithms and applications to VLSI design
• Optimal Linear Ordering
• Mapping the genome
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Molecular solution to the optimal linear arrangement problem based on DNA computation