Evidence map›Paper›PMID 21244715›Full record

ArticleBMC bioinformatics2011

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

Oleksii Kuchaiev, Aleksandar Stevanović, Wayne Hayes, Nataša Pržulj

Abstract read
In one paragraph

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

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

20 citing papers in PubMed.

  1. Evolving topological order in the postnatal visceral pleura.Developmental dynamics : an official publication of the American Association of Anatomists · 2024
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. The post-genomic era of biological network alignment.EURASIP journal on bioinformatics & systems biology · 2015
    Article
  10. Article
  11. Article
  12. Article
  13. Review
  14. Review
  15. Article
  16. Article
  17. Article
  18. Article
  19. Viruses and interactomes in translation.Molecular & cellular proteomics : MCP · 2012
    Article
  20. Comparative interactomics with Funcoup 2.0.Nucleic acids research · 2012
    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

4 authors.

Oleksii KuchaievDepartment of Computer Science, University of California, Irvine, CA, USA.
Aleksandar Stevanović
Wayne Hayes
Nataša Pržulj

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundRecent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype.

resultsWe introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an algorithm for clustering nodes within a network based solely on their topological similarities. Using GraphCrunch 2, we demonstrate that eukaryotic and viral PPI networks may belong to different graph model families and show that topology-based clustering can reveal important functional similarities between proteins within yeast and human PPI networks.

conclusionsGraphCrunch 2 is a software tool that implements the latest research on biological network analysis. It parallelizes computationally intensive tasks to fully utilize the potential of modern multi-core CPUs. It is open-source and freely available for research use. It runs under the Windows and Linux platforms.

Indexed as

Models, BiologicalSoftwareAlgorithmsCluster AnalysisHumansProtein Interaction MappingSequence AlignmentViral ProteinsViral Proteins

Identifiers

PMID21244715
PMCPMC3036622

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.