Evidence map›Paper›PMID 20628593›Full record

ArticleCancer informatics2010

Optimal network alignment with graphlet degree vectors.

Tijana Milenković, Weng Leong Ng, Wayne Hayes, Natasa Przulj

Abstract read
In one paragraph

Article in Cancer informatics, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 48 papers.

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

48 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Article
  13. Pairwise Versus Multiple Global Network Alignment.IEEE access : practical innovations, open solutions · 2020
    Article
  14. Review
  15. Article
  16. Article
  17. A Guide to Conquer the Biological Network Era Using Graph Theory.Frontiers in bioengineering and biotechnology · 2020
    Review
  18. Article
  19. Article
  20. 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.

Tijana MilenkovićDepartment of Computing, Imperial College London SW7 2AZ, UK.
Weng Leong Ng
Wayne Hayes
Natasa Przulj

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology.

Indexed as

biological networksnetwork alignmentnetwork topologyphylogenyprotein function prediction

Identifiers

PMID20628593
PMCPMC2901631

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.