Evidence map›Paper›PMID 22726767›Full record

ArticleBMC bioinformatics2012

Automated hierarchical classification of protein domain subfamilies based on functionally-divergent residue signatures.

Andrew F Neuwald, Christopher J Lanczycki, Aron Marchler-Bauer

Abstract read
In one paragraph

Article in BMC bioinformatics, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Evaluating, comparing, and interpreting protein domain hierarchies.Journal of computational biology : a journal of computational molecular cell biology · 2014
    Article
  6. A Bayesian sampler for optimization of protein domain hierarchies.Journal of computational biology : a journal of computational molecular cell biology · 2014
    Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Andrew F NeuwaldInstitute for Genome Sciences and Department of Biochemistry & Molecular Biology, University of Maryland School of Medicine, BioPark II, Room 617, 801 West Baltimore St, Baltimore, MD 21201, USA. aneuwald@som.umaryland.edu
Christopher J Lanczycki
Aron Marchler-Bauer

Funding

Predicting common protein mechanisms by the light of evolutionR01GM078541 · NIGMS · UNIVERSITY OF MARYLAND BALTIMORE · PI NEUWALD, ANDREW F · 2006 to 2009
$1.0M
Intramural NIH HHSNIGMS NIH HHS GM078541NIGMS NIH HHS R01 GM078541
6 · The paper itself

Abstract

backgroundThe NCBI Conserved Domain Database (CDD) consists of a collection of multiple sequence alignments of protein domains that are at various stages of being manually curated into evolutionary hierarchies based on conserved and divergent sequence and structural features. These domain models are annotated to provide insights into the relationships between sequence, structure and function via web-based BLAST searches.

resultsHere we automate the generation of conserved domain (CD) hierarchies using a combination of heuristic and Markov chain Monte Carlo (MCMC) sampling procedures and starting from a (typically very large) multiple sequence alignment. This procedure relies on statistical criteria to define each hierarchy based on the conserved and divergent sequence patterns associated with protein functional-specialization. At the same time this facilitates the sequence and structural annotation of residues that are functionally important. These statistical criteria also provide a means to objectively assess the quality of CD hierarchies, a non-trivial task considering that the protein subgroups are often very distantly related--a situation in which standard phylogenetic methods can be unreliable. Our aim here is to automatically generate (typically sub-optimal) hierarchies that, based on statistical criteria and visual comparisons, are comparable to manually curated hierarchies; this serves as the first step toward the ultimate goal of obtaining optimal hierarchical classifications. A plot of runtimes for the most time-intensive (non-parallelizable) part of the algorithm indicates a nearly linear time complexity so that, even for the extremely large Rossmann fold protein class, results were obtained in about a day.

conclusionsThis approach automates the rapid creation of protein domain hierarchies and thus will eliminate one of the most time consuming aspects of conserved domain database curation. At the same time, it also facilitates protein domain annotation by identifying those pattern residues that most distinguish each protein domain subgroup from other related subgroups.

Indexed as

Conserved SequenceDatabases, ProteinProteinsProtein Structure, TertiaryAlgorithmsAmino Acid SequenceMarkov ChainsMonte Carlo MethodPhylogenyProtein FoldingSequence AlignmentProteins

Identifiers

PMID22726767
PMCPMC3599474

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.