Affiliation:
1. Massachusetts Institute of Technology, Cambridge
Abstract
A number of current technologies allow for the determination of interatomic distance information in structures such as proteins and RNA. Thus, the reconstruction of a three-dimensional set of points using information about its interpoint distances has become a task of basic importance in determining molecular structure. The distance measurements one obtains from techniques such as NMR are typically sparse and error-prone, greatly complicating the reconstruction task. Many of these errors result in distance measurements that can be safely assumed to lie within certain fixed tolerances. But a number of sources of systematic error in these experiments lead to inaccuracies in the data that are very hard to quantify; in effect, one must treat certain entries of the measured distance matrix as being arbitrarily “corrupted.”
The existence of arbitrary errors leads to an interesting sort of error-correction problem—how many corrupted entries in a distance matrix can be efficiently corrected to produce a consistent three-dimensional structure? For the case of an
n × n
matrix in which every entry is specified, we provide a randomized algorithm running in time
O(n log n)
that enumerates all structures consistent with at most (1/2-ε)n errors per row, with high probability. In the case of randomly located errors, we can correct errors of the same density in a sparse matrix-one in which only a β fraction of the entries in each row are given, for any constant βgt;0.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference23 articles.
1. When is a bipartite graph a rigid framework;BOLKER E. D.;Pacific J. Math.,1980
2. BOLLOBAS B. 1978. Extremal Graph Theory. Academic Press Orlando Fla. BOLLOBAS B. 1978. Extremal Graph Theory. Academic Press Orlando Fla.
3. CAUCHY A.L. 1813. Sur les polygones et poly6dres. J. E cole Polytech. 19 87-90. CAUCHY A.L. 1813. Sur les polygones et poly6dres. J. E cole Polytech. 19 87-90.
4. DIMACS Series;COYYELLY R.
5. CRIPPEN G. M. AND HAVEL T.F. 1988. Distance Geometry and Molecular Conformation. Wiley New York. CRIPPEN G. M. AND HAVEL T.F. 1988. Distance Geometry and Molecular Conformation. Wiley New York.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献