Construction of DNA restriction maps based on a simplified experiment

Bioinformatics. 2001 May;17(5):398-404. doi: 10.1093/bioinformatics/17.5.398.

Abstract

Motivation: A formulation of a new problem of the restriction map construction based on a simplified digestion experiment and a development of an algorithm for solving both ideal and noisy data cases of the introduced problem.

Results: A simplified partial digest problem and a branch and cut algorithm for finding the solution of the problem.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Computational Biology
  • DNA / genetics*
  • Data Interpretation, Statistical
  • Restriction Mapping / statistics & numerical data*

Substances

  • DNA