Molecular solutions for double and partial digest problems in polynomial time
AbstractA fundamental problem in computational biology is the construction of physical maps of chromosomes from the hybridization experiments between unique probes and clones of chromosome fragments. Double and partial digest problems are two intractable problems used to construct physical maps of DNA molecules in bioinformatics. Several approaches, including exponential algorithms and heuristic algorithms, have been proposed to tackle these problems. In this paper we present two polynomial time molecular algorithms for both problems. For this reason, a molecular model similar to Adleman and Lipton model is presented. The presented operations are simple and performed in polynomial time. Our algorithms are computationally simulated.
Download data is not yet available.
How to Cite
Ganjtabesh, M., Ahrabian, H., & Dalini, A. N. (2012). Molecular solutions for double and partial digest problems in polynomial time. COMPUTING AND INFORMATICS, 28(5), 599–618. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/51