Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
PREDICTION OF PROTEIN 3-DIMENSIONAL STRUCTURES IN INSERTION AND DELETION REGIONS - A PROCEDURE FOR SEARCHING DATA-BASES OF REPRESENTATIVE PROTEIN-FRAGMENTS USING GEOMETRIC SCORING CRITERIA
Autore:
FECHTELER T; DENGLER U; SCHOMBURG D;
Indirizzi:
GESELL BIOTECHNOL FORSCH MBH,DEPT MOLEC STRUCT RES,MASCHERODER WEG 1 D-38124 BRAUNSCHWEIG GERMANY GESELL BIOTECHNOL FORSCH MBH,DEPT MOLEC STRUCT RES D-38124 BRAUNSCHWEIG GERMANY
Titolo Testata:
Journal of Molecular Biology
fascicolo: 1, volume: 253, anno: 1995,
pagine: 114 - 131
SICI:
0022-2836(1995)253:1<114:POP3SI>2.0.ZU;2-M
Fonte:
ISI
Lingua:
ENG
Soggetto:
HOMOLOGOUS PROTEINS; SEQUENCE; SUBSTRUCTURES; CONFORMATIONS; SIMULATION; ALGORITHM; BACKBONE; ANGLES; MOTIFS;
Keywords:
CLUSTER ANALYSIS; DATA BASE SEARCH PROCEDURE; FRAGMENT RANKING; INSERTIONS DELETIONS; PROTEIN STRUCTURE PREDICTION;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Science Citation Index Expanded
Citazioni:
44
Recensione:
Indirizzi per estratti:
Citazione:
T. Fechteler et al., "PREDICTION OF PROTEIN 3-DIMENSIONAL STRUCTURES IN INSERTION AND DELETION REGIONS - A PROCEDURE FOR SEARCHING DATA-BASES OF REPRESENTATIVE PROTEIN-FRAGMENTS USING GEOMETRIC SCORING CRITERIA", Journal of Molecular Biology, 253(1), 1995, pp. 114-131

Abstract

The prediction of protein structure in insertion/deletion regions (referred to as indels) is an important part of protein model building byhomology. Here we combine cluster analysis with data base search procedures. initially, data bases of representative protein fragments are constructed using two different clustering algorithms. In the HCAPD (hierarchical clustering after preliminary division) approach, all protein fragments are divided into classes with similar anchor region structures (a protein fragment consists of two anchoring regions and a central region). Within these classes the fragments are further clustered using a hierarchical cluster algorithm. The DCANN (deterministic clustering by assignment of all nearest neighbours) approach is a variant of the k-nearest neighbours cluster algorithm. Only geometric scoring criteria are used for data base searching. The main advantage of a non-redundant data base is the ability to provide structurally different fragments during the search process, which leads to an improvement in structure prediction. Both methods have been tested on 71 insertions and 74 deletions with lengths between one and eight residues. (C) 1995 Academic Press Limited

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/11/20 alle ore 15:22:01