Construction of DNA restriction maps based on a simplified experiment
Open Access
- 1 May 2001
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 17 (5) , 398-404
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. Contact: blazewic@sol.put.poznan.pl * To whom correspondence should be addressed. † Fellowship holder of the Foundation for Polish Sciences.Keywords
This publication has 7 references indexed in Scilit:
- Introduction to Computational Biology: Maps, Sequences and Genomes.1998
- Physical Mapping of Chromosomes Using Unique ProbesJournal of Computational Biology, 1995
- A Lower Bound on the Number of Solutions to the Probed Partial Digest ProblemAdvances in Applied Mathematics, 1993
- Multiple solutions of DNA restriction mapping problemsAdvances in Applied Mathematics, 1991
- Restriction map construction using a ‘complete sentences compatibility’ algorithmBioinformatics, 1988
- Errors between sites in restriction site mappingBioinformatics, 1988
- Mapping DNA by stochastic relaxationAdvances in Applied Mathematics, 1987