Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
1-2
pubmed:dateCreated
2000-11-13
pubmed:abstractText
Optical mapping is a novel technique for determining the restriction sites on a DNA molecule by directly observing a number of partially digested copies of the molecule under a light microscope. The problem is complicated by uncertainty as to the orientation of the molecules and by erroneous detection of cuts. In this paper we study the problem of constructing a restriction map based on optical mapping data. We give several variants of a polynomial reconstruction algorithm, as well as an algorithm that is exponential in the number of cut sites, and hence is appropriate only for small number of cut sites. We give a simple probabilistic model for data generation and for the errors and prove probabilistic upper and lower bounds on the number of molecules needed by each algorithm in order to obtain a correct map, expressed as a function of the number of cut sites and the error parameters. To the best of our knowledge, this is the first probabilistic analysis of algorithms for the problem. We also provide experimental results confirming that our algorithms are highly effective on simulated data.
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:issn
1066-5277
pubmed:author
pubmed:issnType
Print
pubmed:volume
7
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
303-16
pubmed:dateRevised
2008-11-21
pubmed:meshHeading
pubmed:articleTitle
Algorithms for optical mapping.
pubmed:affiliation
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley 94720, USA. karp@cs.berkeley.edu
pubmed:publicationType
Journal Article