Evidence map›Paper›PMID 21999284›Full record

ArticleJournal of computational biology : a journal of computational molecular cell biology2011

Learning cellular sorting pathways using protein interactions and sequence motifs.

Tien-Ho Lin, Ziv Bar-Joseph, Robert F Murphy

Abstract read
In one paragraph

Article in Journal of computational biology : a journal of computational molecular cell biology, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. 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.

Tien-Ho LinLanguage Technology Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA.
Ziv Bar-Joseph
Robert F Murphy

Funding

BUILDING AND VALIDATING LOCATION PROTEOMICS DATABASESR01GM075205 · NIGMS · CARNEGIE-MELLON UNIVERSITY · PI MURPHY, ROBERT F · 2007 to 2011
$1.8M
NIGMS NIH HHS R01 GM075205
6 · The paper itself

Abstract

Proper subcellular localization is critical for proteins to perform their roles in cellular functions. Proteins are transported by different cellular sorting pathways, some of which take a protein through several intermediate locations until reaching its final destination. The pathway a protein is transported through is determined by carrier proteins that bind to specific sequence motifs. In this article, we present a new method that integrates protein interaction and sequence motif data to model how proteins are sorted through these sorting pathways. We use a hidden Markov model (HMM) to represent protein sorting pathways. The model is able to determine intermediate sorting states and to assign carrier proteins and motifs to the sorting pathways. In simulation studies, we show that the method can accurately recover an underlying sorting model. Using data for yeast, we show that our model leads to accurate prediction of subcellular localization. We also show that the pathways learned by our model recover many known sorting pathways and correctly assign proteins to the path they utilize. The learned model identified new pathways and their putative carriers and motifs and these may represent novel protein sorting mechanisms. Supplementary results and software implementation are available from http://murphylab.web.cmu.edu/software/2010_RECOMB_pathways/.

Indexed as

Protein Sorting SignalsProtein TransportSoftwareAlgorithmsAmino Acid MotifsArtificial IntelligenceComputer SimulationFungal ProteinsMarkov ChainsModels, BiologicalProtein Interaction Domains and MotifsFungal ProteinsProtein Sorting Signals

Identifiers

PMID21999284
PMCPMC3216107

What OpenQuestion holds

Textmetadata
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.