AN ALGORITHM FOR ANALYZING PROBED PARTIAL DIGESTION EXPERIMENTS

Citation
Rm. Karp et La. Newberg, AN ALGORITHM FOR ANALYZING PROBED PARTIAL DIGESTION EXPERIMENTS, Computer applications in the biosciences, 11(3), 1995, pp. 229-235
Citations number
7
Categorie Soggetti
Mathematical Methods, Biology & Medicine","Computer Sciences, Special Topics","Computer Science Interdisciplinary Applications","Biology Miscellaneous
ISSN journal
02667061
Volume
11
Issue
3
Year of publication
1995
Pages
229 - 235
Database
ISI
SICI code
0266-7061(1995)11:3<229:AAFAPP>2.0.ZU;2-U
Abstract
A partial digestion of DNA (e.g. cosmid, Lambda, YAC, chromosome) is p erformed and the lengths of theses fragments which hybridize to a labe led probe are measured using gel electrophoresis. We give an efficient algorithm that takes as input this experimental data and proposes one or more candidate solutions. Each solution designates the location of each restriction sire and specifies the endpoints of each fragment. ( Further experiments can then be designed to select the correct solutio n from this small set of candidates.) The algorithm works well even wh en the experiment gives inexact values for the lengths.