A comparison of algorithms for the pairwise alignment of biological networks. (2nd May 2014)

• Record Type: Journal Article
• Authors: Clark, Connor; Kalita, Jugal
• Is Part Of: Bioinformatics. Volume 30:Number 16(2014)
• Page Start: 2351
• Page End: 2359
• Publication Date: 2014-05-02
• Subjects: Bioinformatics -- Periodicals; Genomics -- Data processing -- Periodicals; Computational biology -- Periodicals; 572.80285
• DOI: 10.1093/bioinformatics/btu307
• Languages: English
• ISSNs: 1367-4803

Abstract

Abstract : Motivation: As biological inquiry produces ever more network data, such as protein–protein interaction networks, gene regulatory networks and metabolic networks, many algorithms have been proposed for the purpose of pairwise network alignment —finding a mapping from the nodes of one network to the nodes of another in such a way that the mapped nodes can be considered to correspond with respect to both their place in the network topology and their biological attributes. This technique is helpful in identifying previously undiscovered homologies between proteins of different species and revealing functionally similar subnetworks. In the past few years, a wealth of different aligners has been published, but few of them have been compared with one another, and no comprehensive review of these algorithms has yet appeared. Results: We present the problem of biological network alignment, provide a guide to existing alignment algorithms and comprehensively benchmark existing algorithms on both synthetic and real-world biological data, finding dramatic differences between existing algorithms in the quality of the alignments they produce. Additionally, we find that many of these tools are inconvenient to use in practice, and there remains a need for easy-to-use cross-platform tools for performing network alignment. Contact: [e-mail], [e-mail] Supplementary information: Supplementary data are available at Bioinformatics online.