๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Analysis of Protein Structural Motifs in Terms of Sets of Codes Representing Local Structures

โœ Scribed by J. An; H. Wako; A. Sarai


Book ID
110320492
Publisher
SP MAIK Nauka/Interperiodica
Year
2001
Tongue
English
Weight
85 KB
Volume
35
Category
Article
ISSN
0026-8933

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Enlarged representative set of protein s
โœ Uwe Hobohm; Chris Sander ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Cold Spring Harbor Laboratory Press ๐ŸŒ English โš– 295 KB

## Abstract TO reduce redundancy in the Protein Data Bank of 3D protein structures, which is caused by many homologous proteins in the data bank, we have selected a representative set of structures. The selection algorithm was designed to (1) select as many nonhomologous structures as possible, and

Discovery of local packing motifs in pro
โœ Inge Jonassen; Ingvar Eidhammer; William R. Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 777 KB

We present a language for describing structural patterns of residues in protein structures and a method for the discovery of such patterns that recur in a set of protein structures. The patterns impose restrictions on the spatial position of each residue, their order along the amino acid chain, and

Kinetic analysis of local structure form
โœ Minoru I. Kanehisa; Tian Yow Tsong ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 809 KB

## Abstract The protein folding process is described by a cluster model based on the assumption that local structures or clusters are formed at an early stage in different regions of the polypeptide chain. Possible local structural elements in a globular protein are helices, bends, and hydrophobic

Algebraic Structures of Rough Sets in Re
โœ Zbigniew Bonikowski ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 789 KB

In this paper a generalized notion of an approximation space is considered. By an approximation space we mean an ordered pair \((U, \mathbb{C})\), where \(U\) is a finite nonempty set and \(\mathbb{C}\) is a covering of \(U\). According to connections between rough sets and concepts we define two ty