Preview

An Implementation of a Backtracking Algorithm for the Turnpike Problem in Membranes

Powerful Essays
Open Document
Open Document
10209 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
An Implementation of a Backtracking Algorithm for the Turnpike Problem in Membranes
An Implementation of a Backtracking Algorithm for the Turnpike Problem in Membranes
Maria Cristina Albores, Richelle Ann Juayong, and Henry Adorna
Department of Computer Science (Algorithms and Complexity) Velasquez Ave., UP Diliman Quezon City 1101


[maalbores, rbjuayong, hnadorna]@up.edu.ph ABSTRACT
The goal of the Turnpike Problem is to reconstruct those point sets that arise from a given distance multiset. Although the Turnpike Problem itself is of unknown complexity, variants of it have been proven to be NP-complete, and there are no existing polynomial algorithms for it. P systems with active membranes and P systems with membrane creation are parallel computing models based on the characteristics of living cells; both have been used to solve NPcomplete problems in polynomial time or better by trading time for an exponential workspace. In this paper we present a P system with active membranes and membrane creation that implements an O(2n n log n)-time backtracking algorithm for the Turnpike Problem in linear time. multiset; according to [9], when these point sets are unique (that is, none of them is a reflection of another), they are called homometric sets. TP first appeared in the 1930’s as a problem in X-ray crystallography, and reappeared in DNA sequencing as the Partial Digest Problem (PDP). The exact computational complexity of TP remains an open problem, although certain variants of it, as well as the decision problem of whether n points in R realize a multiset of n distances, have been proven to be NP-complete 2 in [9]. (Similarly, PDP’s own computational complexity is an open problem; variants of it are proven to be NP-hard or NP-complete in [2].) However, no polynomial-time algorithm has been found that solves TP. Among the algorithms that have been proposed is a polynomial factorization algorithm presented by Rosenblatt and Seymour in [8], and a backtracking algorithm presented by Skiena et al in [9]. The polynomial factorization algorithm



References: [1] A. Atanasiu. Arithmetic with membranes. In Pre-proceedings of the Workshop on Multiset Processing (Curtea de Arges, Romania), pages 1–17, 2000. (see also CDMTCS Research Report No. 140, 2000, Auckland Univ., New Zealand, www.cs.auckland.ac.nz/CDMTCS). [2] M. Cieliebak. Algorithms and Hardness Results for DNA Physical Mapping, Protein Identification, and

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Given $U$ as the set all the devices located at the edge of the network with physical proximity of the device that wants to request computational resources $D$. Therefore, the PAR problem can be modeled as a graph $G$, where the vertexes of this graph are elements of the set U, and the edges of G are the communication link between them. In our approach, the vertexes are classified according to into the following types:…

    • 232 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    6) Trapdoor(GP,pkS,skRi,Q): Taking GP,pkS,pkRi and a keyword queries for Q=(w1,.wm),m<=las the source of information ,it yields a trapdoor TQ, 1 for Q produced by Ri.…

    • 259 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    References: © The Authors JCSCR. (2012). A Comparative Study on the Performance. LACSC – Lebanese Association for Computational Sciences Registered under No. 957, 2011, Beirut, Lebanon, 1-12.…

    • 664 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Bio 1151 Study Guide

    • 919 Words
    • 4 Pages

    BIOINFORMATIC- use of computational tools to process a large volume of data, used in genomics…

    • 919 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    LYT2 Task2

    • 4061 Words
    • 12 Pages

    Stein, S. S., Gerding, E. H., Rogers, A. C., Larson, K. K., & Jennings, N. R. (2011). Algorithms…

    • 4061 Words
    • 12 Pages
    Satisfactory Essays
  • Better Essays

    This experiment gave a visual understanding of osmosis and diffusion. The first experiment proved that solutes would move down a concentration gradient if permeable to the selective membrane. The second experiment proved different solute concentrations affect the movement of water, depending on the solute concentration inside the cell. The purpose of this lab was to look for different solutes that can cross an artificial membrane and to observe the effect of different concentrations of sucrose on the mass of a potato cell. Results for Part One suggested that the molecular weight of albumin and starch was too large to pass through the dialysis tube, but glucose and sodium sulfate molecules were small enough to pass through the dialysis tube. Also, a decrease in water weight occurred due the dialysis tube being placed in a hypertonic solution. Results for Par Two showed the potato cell having a molar concentration of 0.2734, which caused sucrose concentrations above 0.2 M to have a decrease in mass. Inversely, sucrose concentrations below 0.2 M caused an increase in mass.…

    • 2179 Words
    • 9 Pages
    Better Essays
  • Powerful Essays

    In this assignment, I have developed a CFD code to solve the wave equation numerically. I have…

    • 1680 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    The purpose of this lab was to hypothesize about membrane traffic in lab, explain the differences between the solutions hypertonic, hypotonic, and isotonic and how they respond using the understanding of the cell membrane structure, types of transport mechanisms such as active, passive, diffusion, osmosis, and explain the movement of particles moving across the cell membrane. In this lab was divided into two parts. The first part was varying the concentration and the second part was varying the temperature. All cells are controlled by a cell membrane or plasma membrane that keeps the materials inside. When I think of a cell membrane I think of a grocery bag with small holes, the bag grasps all of the cell parts and fluids in the bag.…

    • 463 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Primrose, S. B. (1998). Principles of Genome Analysis: A Gudie to Mapping and Sequencing DNA from Different Organisms (2nd ed.). Malden: Blackwell Science.…

    • 2156 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    Membrane potential

    • 918 Words
    • 4 Pages

    1. Given that cell A has significantly more nongated K+ channels than cell B, which cell has the larger resting membrane potential? Explain.…

    • 918 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Project Plan

    • 9315 Words
    • 38 Pages

    Loewe, L (2002). Global computing for bioinformatics. Briefings in Bioinformatics; Vol. 3 Issue 4, p377. Retrieved June 3, 2006 from EBSCOhost database, University of Phoenix Online Library Collection.…

    • 9315 Words
    • 38 Pages
    Good Essays
  • Powerful Essays

    United States Patent and Trademark Office. (2008, December 18). 2106.2 **>Mathematical Algorithms< [R-5] – 2100 Patentability. Retrieved December 4, 2010 from http://www.uspto.gov/web/offices/pac/mpep/documents/2100_2106_02.htm…

    • 1793 Words
    • 8 Pages
    Powerful Essays
  • Good Essays

    Determining the structure for DNA was one of the outstanding science achievements of the 20th century.…

    • 437 Words
    • 2 Pages
    Good Essays
  • Better Essays

    Each of the specific clusters is determined by assigning the original point xi to cluster j if and only if i-th row of the matrix M was assigned to cluster j.…

    • 1701 Words
    • 7 Pages
    Better Essays
  • Good Essays

    DNA COMPUTING

    • 2608 Words
    • 11 Pages

    Zingel, T. Formal Models of DNA Computing: A Survey. Proc. Estonian Acad. Sci. Phys. Math.,…

    • 2608 Words
    • 11 Pages
    Good Essays