Show simple item record

dc.contributor.authorDong, Qunfeng
Wu, Zhijun
dc.date.accessioned 2018-06-18T17:48:43Z
dc.date.available 2018-06-18T17:48:43Z
dc.date.issued 2001-06
dc.identifier.citation Dong, Qunfeng and Wu, Zhijun. "A Linear-Time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances." (2001) https://hdl.handle.net/1911/101975.
dc.identifier.urihttps://hdl.handle.net/1911/101975
dc.description.abstract We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry algorithms for protein modeling such as the EMBED algorithm by Crippen and Havel. However, previous approaches to the problem rely on decomposing a distance matrix or minimizing an error function and require O(n2) to O(n3) floating point operations. The linear-time algorithm will provide a much more efficient approach to the problem, especially in large-scale applications. It exploits the problem structure and hence is able to identify infeasible data more easily as well.
dc.format.extent 13 pp
dc.title A Linear-Time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances
dc.type Technical report
dc.date.note June 2001
dc.identifier.digital TR01-13
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record