Conventional fold recognition techniques rely mainly on the analysis of the entire sequence of a protein. We present an MBA method to improve performance of any conventional sequence-based fold assignment. The method uses sequence motifs, such as those defined in the Prosite database, and the SwissProt annotation of the fold library. When combined with a simple SDP method, the coverage of MBA i...

We have constructed, in a completely automated fashion, a new structure template library for threading that represents 358 distinct SCOP folds where each model is mathematically represented as a Hidden Markov model (HMM). Because the large number of models in the library can potentially dilute the prediction measure, a new triage method for fold prediction is employed. In the first step of the ...

Necessary and sufficient conditions on n and A are given for the existence an edge-disjoint decomposition of AKn into copies of the graph of a 3-dimensional cube. Also, necessary and sufficient conditions on m, nand>' are given for similar decompositions of >'Km,n'