![]() |
![]() |
|
PUU method description
PUU is a recursive top-down approach which uses a hypothetical model of autonomously folding units corresponding to protein domains. The domains are defined as groups of residues that oscillate as a single unit relative to other residue groups. The amplitude of oscillation is determined by oscillating time τ. A greater τ indicates a greater mobility and a greater probability for a given group of residues to reside in separate domains. The oscillation time is proportional in the center of mass of the group and is inversely proportional to the so-called interference strength. The interference strength is calculated by evaluating pair-wise residue-residue interactions, which in turn are calculated for any two atoms in two residues which are 4Å apart or less. A hierarchical 5-level filtering process is applied during partitioning of the structure. The process does not require all five conditions to be met. Rather, if the condition for applying the filter is true the lower filters are not tested. The filters applied are: (1) the domain should have at least 80 residues to be considered for cutting; (2) highly flexible units are always cut (defined in terms of τ); (3) β-sheets forming a network are never cut; (4) the cut is accepted if both sub-domains are compact (globularity >0.8); and (5) a cut that yields a small non-globular unit (<40 residues) is accepted on condition that the situation is rectified in the recursive application of the filters. PUU is the oldest method and has the worse performance among the four methods analyzed. It has a strong tendency to overcut - i.e. predict more domains than experts (Figure 4A, 4B). Striving to achieve compact domains, the method frequently assembles domains out of non-contiguous fragments. Sometimes the number of fragment per domain, s, is too large to be evolutionarily sensible. Furthermore the compactness factor appears to confer unrealistically high significance. PUU does not have constraints to prevent splitting α-helices between domains, thus it frequently cuts through helices. However, its rules about integrity of β-sheets, which form 'highly cooperative networks,' sometimes leave PUU unable to partition all-β structures or structures with a significant fraction of β-sheets (Figure 4C, 4D, 4E, 4D). ![]() Figure 4. Domain assignment by PUU method. |
This work is sponsored by the National Institutes of Heath (NIH) Grant Number GM63208 (NIH/NIGMS)