ViraScience.
Article

Modeling of Partial Digest Problem as a Network flows problem

O. Ranjbar, R. Nadimi

Abstract

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest method, all pairwise distances between restriction sites are produced. Mathematically, given pairwise distances between n points on a line segment, the goal is to find that points. This problem has been named Partial Digest Problem(PDP). In this paper we present a new model for PDP using generalized network flows. Since complexity class of this problem is one of the most important open problems in bioinformatics (there is no polynomial algorithm and no proof for Np-completeness) reducing to a network flow problem create a new viewpoint to challenge with this problem.

Similar items

  • The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis

    Scholarly record2005Zoë Abrams, Ho-Lin Chen

    Introduction We study the problem of genome mapping using restriction site analysis. In restriction site analysis, an enzyme cuts a target DNA strand into DNA fragments, and these DNA fragments are used to reconstruct the restriction site locations of the enzyme. Two common appro

  • Noisy Data Make the Partial Digest Problem NP-hard

    Scholarly record2003WABIMark Cieliebak, Stephan Eidenbenz, Paolo Penna

    The problem to find the coordinates of n points on a line such that the pairwise distances of the points form a given multi-set of n 2 distances is known as Partial Digest problem, which occurs for instance in DNA physical mapping and de novo sequencing of proteins. Although Part

  • Noisy Data Make the Partial Digest Problem NP - hardTECHNICAL

    Scholarly record2007Mark Cieliebak, Stephan Eidenbenz, Paolo Penna

    The Partial Digest problem { well-known for its applications in computational biology and for the intriguingly open status of its computational complexity { asks for the coordinates of n points on a line such that the pairwise distances of the points form a given multi-set of ? n

  • The Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

    Scholarly record2009Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev

    We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong s

  • An intelligent modeling system for generalized network flow problems: With application to planning for multinational firms

    Scholarly record1997Annals ORRichard D. McBride, Daniel E. O'Leary

    This paper presents a discussion of the Generalized Network System (GNS), a system that captures knowledge about generalized network flow problems, in order to help users formulate, solve and interpret generalized network flow problems. Although previous researchers have built in

  • Molecular solutions for double and partial digest problems in polynomial time

    Scholarly record2009Computing and InformaticsMohammad Ganjtabesh, Haydeh Ahrabian, Abbas Nowzari-Dalini

    A 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 physic