↓ Skip to main content

Fair evaluation of global network aligners

Overview of attention for article published in Algorithms for Molecular Biology, June 2015
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age

Mentioned by

twitter
3 tweeters

Citations

dimensions_citation
18 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Fair evaluation of global network aligners
Published in
Algorithms for Molecular Biology, June 2015
DOI 10.1186/s13015-015-0050-8
Pubmed ID
Authors

Joseph Crawford, Yihan Sun, Tijana Milenković

Abstract

Analogous to genomic sequence alignment, biological network alignment identifies conserved regions between networks of different species. Then, function can be transferred from well- to poorly-annotated species between aligned network regions. Network alignment typically encompasses two algorithmic components: node cost function (NCF), which measures similarities between nodes in different networks, and alignment strategy (AS), which uses these similarities to rapidly identify high-scoring alignments. Different methods use both different NCFs and different ASs. Thus, it is unclear whether the superiority of a method comes from its NCF, its AS, or both. We already showed on state-of-the-art methods, MI-GRAAL and IsoRankN, that combining NCF of one method and AS of another method can give a new superior method. Here, we evaluate MI-GRAAL against a newer approach, GHOST, by mixing-and-matching the methods' NCFs and ASs to potentially further improve alignment quality. While doing so, we approach important questions that have not been asked systematically thus far. First, we ask how much of the NCF information should come from protein sequence data compared to network topology data. Existing methods determine this parameter more-less arbitrarily, which could affect alignment quality. Second, when topological information is used in NCF, we ask how large the size of the neighborhoods of the compared nodes should be. Existing methods assume that the larger the neighborhood size, the better. Our findings are as follows. MI-GRAAL's NCF is superior to GHOST's NCF, while the performance of the methods' ASs is data-dependent. Thus, for data on which GHOST's AS is superior to MI-GRAAL's AS, the combination of MI-GRAAL's NCF and GHOST's AS represents a new superior method. Also, which amount of sequence information is used within NCF does not affect alignment quality, while the inclusion of topological information is crucial for producing good alignments. Finally, larger neighborhood sizes are preferred, but often, it is the second largest size that is superior. Using this size instead of the largest one would decrease computational complexity. Taken together, our results represent general recommendations for a fair evaluation of network alignment methods and in particular of two-stage NCF-AS approaches.

Twitter Demographics

The data shown below were collected from the profiles of 3 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 8 800%
Student > Master 7 700%
Unspecified 6 600%
Student > Doctoral Student 3 300%
Lecturer 2 200%
Other 5 500%
Readers by discipline Count As %
Unspecified 8 800%
Engineering 7 700%
Design 5 500%
Environmental Science 4 400%
Arts and Humanities 3 300%
Other 4 400%

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 28 June 2015.
All research outputs
#7,020,453
of 11,293,566 outputs
Outputs from Algorithms for Molecular Biology
#92
of 177 outputs
Outputs of similar age
#125,826
of 229,272 outputs
Outputs of similar age from Algorithms for Molecular Biology
#6
of 7 outputs
Altmetric has tracked 11,293,566 research outputs across all sources so far. This one is in the 23rd percentile – i.e., 23% of other outputs scored the same or lower than it.
So far Altmetric has tracked 177 research outputs from this source. They receive a mean Attention Score of 2.8. This one is in the 40th percentile – i.e., 40% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 229,272 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 35th percentile – i.e., 35% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 7 others from the same source and published within six weeks on either side of this one.