Kooperativer Bibliotheksverbund

Berlin Brandenburg


Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

  • 1
    Language: English
    In: Journal of Global Optimization, 2002, Vol.22(1), pp.365-375
    Description: 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 ( Distance Geometry and Molecular Conformation , Wiley, 1988). However, previous approaches to the problem rely on decomposing an distance matrix or minimizing an error function and require O(n 2 ) to O( 3 ) 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.
    Keywords: Molecular distance geometry ; Protein structure determination ; Numerical linear algebra and optimization
    ISSN: 0925-5001
    E-ISSN: 1573-2916
    Source: Springer Science & Business Media B.V.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages