Abstract
The extraction of well-fitting substructures of two or more sets of proteins has applications to analysis of mechanisms of conformational change in proteins, including pathways of evolution, to classification of protein folding patterns, and to evaluation of protein structure predictions. Many methods are known for extracting some substantial common substructure with low root-mean-square deviation (r.m.s.d.). A harder problem is addressed here: finding all common substructures with r.m.s.d. less than a prespecified threshold. Our approach is to consider the minimum value of the maximum distance between corresponding points, corresponding to superposition in the Chebyshev norm. Using the properties of Chebyshev superposition, we derive relationships between the r.m.s.d. and the maximum element of the difference matrix, two common measures of structural similarity. The results provide a basis for developing algorithms and software to identify all well-fitting subsets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.