Indexé dans
- Base de données des revues académiques
- Ouvrir la porte J
- Genamics JournalSeek
- JournalTOCs
- RechercheBible
- Répertoire des périodiques d'Ulrich
- Bibliothèque des revues électroniques
- RechercheRef
- Université Hamdard
- EBSCO AZ
- OCLC - WorldCat
- érudit
- Catalogue en ligne SWB
- Bibliothèque virtuelle de biologie (vifabio)
- Publions
- MIAR
- Fondation genevoise pour la formation et la recherche médicales
- Pub européen
- Google Scholar
Liens utiles
Partager cette page
Dépliant de journal
Revues en libre accès
- Agriculture et aquaculture
- Alimentation et nutrition
- Biochimie
- Bioinformatique et biologie des systèmes
- Business & Management
- Chimie
- Génétique et biologie moléculaire
- Immunologie & Microbiologie
- Ingénierie
- La science des matériaux
- Neurosciences & Psychologie
- Science générale
- Sciences cliniques
- Sciences environnementales
- Sciences médicales
- Sciences pharmaceutiques
- Sciences vétérinaires
- Soins infirmiers et soins de santé
Abstrait
Quick Reliable Exploration of the PDB Universe Seeks a New Template Search Algorithm
Sunil Nahata and Ashish Runthala
Near-native protein structure prediction through Template Based Modelling (TBM) has been a major realistic goal of structural biology for several years. The TBM algorithms require the best-set of templates for a target protein sequence to maximally cover it and construct its correct topology. However, the accuracy of such prediction algorithms suffers from the algorithmic and logical problems of our template search measures which fail to quickly screen reliable structures for a target sequence. In this study, we employ the culled PDB95 dataset of 41,967 templates to predict the CASP10 target T0752 models for assessing the efficiency of the usually employ search engines PSI-BLAST and HHPred. Our analysis presents a detailed study in order to open new vistas for improving the accuracy of TBM prediction methodologies. It reveals weaknesses of most popular template search measures and thereby briefly provides a significant insight into the qualities of a foreseen template search algorithm to illustrate the need for a more reliable template search algorithm.