BINARY DISCONTINUOUS COMPACT PROTEIN DOMAINS

Few methods exist that identify discontinuous protein domains containi ng more than one polypeptide chain. This paper describes a new method for locating such discontinuous domains based on their compactness, an d applies the methodology to locate the most compact domains in bovine pancreatic trypsin inhibitor, ribonuclease, cytochrome c and myoglobi n. The compactness of all binary discontinuous peptide combinations is first exhaustively evaluated. Several screening steps are then used t o locate those compact units that represent global minima of compactne ss. Since domains are generally taken to be large, mutually exclusive structures that span most of the protein's sequence, compact domains w ere found by examining all compact units (both continuous and disconti nuous) to locate two or three units that span most of the protein's se quence, have little mutual overlap and good overall compactness. Compa ct domains compare well with domains found by other methods and with e xperimental evidence that may differentiate domain structure. The stro ngest experimental evidence for the existence of compact discontinuous domains comes from the work of Oas and Kim [(1988) Nature, 336, 42-48 ] where a peptide that corresponds almost exactly to a compact domain has been synthesized and shown to have native-like structure in soluti on.