ArticlePLoS computational biology2011
Network archaeology: uncovering ancient networks from present-day interactions.
Article in PLoS computational biology, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 23 papers.
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.
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.
Who cites it
23 citing papers in PubMed.
- PhyloSystemX: Enhancing the Analysis of Interaction Networks.Methods in molecular biology (Clifton, N.J.) · 2026Article
- Maximum likelihood estimation for reversible mechanistic network models.Physical review. E · 2023Article
- Maximum likelihood reconstruction of ancestral networks by integer linear programming.Bioinformatics (Oxford, England) · 2021Article
- Inferring Temporal Information from a Snapshot of a Dynamic Network.Scientific reports · 2019Article
- Protein-protein binding selectivity and network topology constrain global and local properties of interface binding networks.Scientific reports · 2017Article
- PROPER: global protein interaction network alignment through percolation matching.BMC bioinformatics · 2016Article
- Structuring evolution: biochemical networks and metabolic diversification in birds.BMC evolutionary biology · 2016Article
- Decreasing-Rate Pruning Optimizes the Construction of Efficient and Robust Distributed Networks.PLoS computational biology · 2015Article
- Topological properties of robust biological and computational networks.Journal of the Royal Society, Interface · 2014Article
- Experimental evidence validating the computational inference of functional associations from gene fusion events: a critical survey.Briefings in bioinformatics · 2014Review
- Evolution after whole-genome duplication: a network perspective.G3 (Bethesda, Md.) · 2013Article
- A probabilistic model of neutral and selective dynamics of protein network evolution.Journal of computational biology : a journal of computational molecular cell biology · 2013Article
- Predicting protein interactions via parsimonious network history inference.Bioinformatics (Oxford, England) · 2013Article
- Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review.Pharmacology & therapeutics · 2013Review
- The evolutionary dynamics of protein-protein interaction networks inferred from the reconstruction of ancient networks.PloS one · 2013Article
- Parsimonious reconstruction of network evolution.Algorithms for molecular biology : AMB · 2012Article
- How networks change with time.Bioinformatics (Oxford, England) · 2012Article
- Diversity in genetic in vivo methods for protein-protein interaction studies: from the yeast two-hybrid system to the mammalian split-luciferase system.Microbiology and molecular biology reviews : MMBR · 2012Review
- How do dynamic cellular signals travel long distances?Molecular bioSystems · 2012Review
- Gene duplicability-connectivity-complexity across organisms and a neutral evolutionary explanation.PloS one · 2012Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
What proteins interacted in a long-extinct ancestor of yeast? How have different members of a protein complex assembled together over time? Our ability to answer such questions has been limited by the unavailability of ancestral protein-protein interaction (PPI) networks. To overcome this limitation, we propose several novel algorithms to reconstruct the growth history of a present-day network. Our likelihood-based method finds a probable previous state of the graph by applying an assumed growth model backwards in time. This approach retains node identities so that the history of individual nodes can be tracked. Using this methodology, we estimate protein ages in the yeast PPI network that are in good agreement with sequence-based estimates of age and with structural features of protein complexes. Further, by comparing the quality of the inferred histories for several different growth models (duplication-mutation with complementarity, forest fire, and preferential attachment), we provide additional evidence that a duplication-based model captures many features of PPI network growth better than models designed to mimic social network growth. From the reconstructed history, we model the arrival time of extant and ancestral interactions and predict that complexes have significantly re-wired over time and that new edges tend to form within existing complexes. We also hypothesize a distribution of per-protein duplication rates, track the change of the network's clustering coefficient, and predict paralogous relationships between extant proteins that are likely to be complementary to the relationships inferred using sequence alone. Finally, we infer plausible parameters for the model, thereby predicting the relative probability of various evolutionary events. The success of these algorithms indicates that parts of the history of the yeast PPI are encoded in its present-day form.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.