{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:52:11Z","timestamp":1740135131734,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"S6","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"vor","delay-in-days":17,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Spanish Ministry of Economy and Competitiveness and European Regional Development Fund project","award":["DPI2015-67082-P (MINECO\/FEDER)"],"award-info":[{"award-number":["DPI2015-67082-P (MINECO\/FEDER)"]}]},{"name":"Spanish Ministry of Economy and Competitiveness and European Regional Development Fund project","award":["DPI2015-67082-P and PGC2018-096956-B-C43 (FEDER\/ MICINN\/AEI)"],"award-info":[{"award-number":["DPI2015-67082-P and PGC2018-096956-B-C43 (FEDER\/ MICINN\/AEI)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>All molecular functions and biological processes are carried out by groups of proteins that interact with each other. Metaproteomic data continuously generates new proteins whose molecular functions and relations must be discovered. A widely accepted structure to model functional relations between proteins are protein-protein interaction networks (PPIN), and their analysis and alignment has become a key ingredient in the study and prediction of protein-protein interactions, protein function, and evolutionary conserved assembly pathways of protein complexes. Several PPIN aligners have been proposed, but attaining the right balance between network topology and biological information is one of the most difficult and key points in the design of any PPIN alignment algorithm.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>Motivated by the challenge of well-balanced and efficient algorithms, we have designed and implemented AligNet, a parameter-free pairwise PPIN alignment algorithm aimed at bridging the gap between topologically efficient and biologically meaningful matchings. A comparison of the results obtained with AligNet and with the best aligners shows that AligNet achieves indeed a good balance between topological and biological matching.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusion<\/jats:title>\n                <jats:p>In this paper we present AligNet, a new pairwise global PPIN aligner that produces biologically meaningful alignments, by achieving a good balance between structural matching and protein function conservation, and more efficient computations than state-of-the-art tools.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-020-3502-1","type":"journal-article","created":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T04:14:07Z","timestamp":1605672847000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["AligNet: alignment of protein-protein interaction networks"],"prefix":"10.1186","volume":"21","author":[{"given":"Adri\u00e0","family":"Alcal\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Alberich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5358-6768","authenticated-orcid":false,"given":"Merc\u00e8","family":"Llabr\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Rossell\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Valiente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,18]]},"reference":[{"issue":"Web Server issu","key":"3502_CR1","doi-asserted-by":"publisher","first-page":"W83","DOI":"10.1093\/nar\/gkh411","volume":"32","author":"BP Kelley","year":"2004","unstructured":"Kelley BP, Yuan B, et al.PathBLAST: a tool for alignment of protein interaction networks. Nucleic Acids Res. 2004; 32(Web Server issue):W83\u201388.","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"3502_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1089\/cmb.2006.13.182","volume":"13","author":"M Koyut\u00fcrk","year":"2006","unstructured":"Koyut\u00fcrk M, Kim Y, et al.Pairwise alignment of protein interaction networks. J Comput Biol. 2006; 13(2):182\u2013199.","journal-title":"J Comput Biol"},{"key":"3502_CR3","doi-asserted-by":"crossref","unstructured":"Li Z, Wang Y, et al.Alignment of protein interaction networks by integer quadratic programming. In: 2006 International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE: 2006. p. 5527\u201330.","DOI":"10.1109\/IEMBS.2006.260106"},{"issue":"17","key":"3502_CR4","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1093\/bioinformatics\/btl287","volume":"22","author":"Z Liang","year":"2006","unstructured":"Liang Z, Xu M, Teng M, Niu L. NetAlign: a web-based tool for comparison of protein interaction networks. Bioinformatics. 2006; 22(17):2175\u20137.","journal-title":"Bioinformatics"},{"issue":"7","key":"3502_CR5","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1089\/cmb.2007.0025","volume":"14","author":"M Narayanan","year":"2007","unstructured":"Narayanan M, Karp RM. Comparing protein interaction networks via a graph match-and-split algorithm. J Comput Biol. 2007; 14(7):892\u2013907.","journal-title":"J Comput Biol"},{"issue":"4","key":"3502_CR6","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/TCBB.2015.2474391","volume":"13","author":"A Elmsallati","year":"2016","unstructured":"Elmsallati A, Clark C, Kalita J. Global alignment of protein-protein interaction networks: A survey. IEEE\/ACM Trans Comput Biol Bioinforma. 2016; 13(4):689\u2013705.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"7","key":"3502_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1093\/bioinformatics\/btt071","volume":"29","author":"AE Aladag\u030c","year":"2013","unstructured":"Aladag\u030c AE, Erten C. SPINAL: Scalable protein interaction network alignment. Bioinformatics. 2013; 29(7):917\u201324.","journal-title":"Bioinformatics"},{"issue":"17","key":"3502_CR8","doi-asserted-by":"publisher","first-page":"i438","DOI":"10.1093\/bioinformatics\/btu450","volume":"30","author":"S Hashemifar","year":"2014","unstructured":"Hashemifar S, Xu J. HubAlign: an accurate and efficient method for global alignment of protein-protein interaction networks. Bioinformatics. 2014; 30(17):i438\u201344.","journal-title":"Bioinformatics"},{"issue":"13","key":"3502_CR9","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1093\/bioinformatics\/btt202","volume":"29","author":"B Neyshabur","year":"2013","unstructured":"Neyshabur B, Khadem A, Hashemifar S, Arab SS. NETAL: a new graph-based method for global alignment of protein-protein interaction networks. Bioinformatics. 2013; 29(13):1654\u201362.","journal-title":"Bioinformatics"},{"issue":"23","key":"3502_CR10","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1093\/bioinformatics\/bts592","volume":"28","author":"R Patro","year":"2012","unstructured":"Patro R, Kingsford C. Global network alignment using multiscale spectral signatures. Bioinformatics. 2012; 28(23):3105\u201314.","journal-title":"Bioinformatics"},{"issue":"35","key":"3502_CR11","doi-asserted-by":"publisher","first-page":"12763","DOI":"10.1073\/pnas.0806627105","volume":"105","author":"R Singh","year":"2008","unstructured":"Singh R, Xu J, Berger B. Global alignment of multiple protein interaction networks with application to functional orthology detection. PNAS. 2008; 105(35):12763\u20138.","journal-title":"PNAS"},{"issue":"16","key":"3502_CR12","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1093\/bioinformatics\/btu307","volume":"30","author":"C Clark","year":"2014","unstructured":"Clark C, Kalita J. A comparison of algorithms for the pairwise alignment of biological networks. Bioinformatics. 2014; 30(16):2351\u20139.","journal-title":"Bioinformatics"},{"key":"3502_CR13","doi-asserted-by":"crossref","unstructured":"Malod-Dognin N, Ban K, Pr\u017eulj N. Unified alignment of protein-protein interaction networks. Sci Rep. 2017; 7(953).","DOI":"10.1038\/s41598-017-01085-9"},{"key":"3502_CR14","unstructured":"Alain FZ, Elena NI, Erik HWG. Meesters. A Beginner\u2019s Guide to R: Springer; 2009."},{"issue":"1","key":"3502_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-421","volume":"10","author":"C Camacho","year":"2009","unstructured":"Camacho C, Coulouris G, et al.BLAST+: architecture and applications. BMC Bioinformatics. 2009; 10(1):1.","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"3502_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/nav.20053","volume":"52","author":"HW Kuhn","year":"2005","unstructured":"Kuhn HW. The Hungarian method for the assignment problem. Naval Res Logist. 2005; 52(1):7\u201321.","journal-title":"Naval Res Logist"},{"key":"3502_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.disopt.2014.11.002","volume":"15","author":"R Bornd\u00f6rfer","year":"2015","unstructured":"Bornd\u00f6rfer R, Heismann O. The hypergraph assignment problem. Discrete Optim. 2015; 15:15\u201325.","journal-title":"Discrete Optim"},{"issue":"1","key":"3502_CR18","doi-asserted-by":"publisher","first-page":"S59","DOI":"10.1186\/1471-2105-10-S1-S59","volume":"10","author":"GW Klau","year":"2009","unstructured":"Klau GW. A new graph-based method for pairwise global network alignment. BMC Bioinformatics. 2009; 10(1):S59.","journal-title":"BMC Bioinformatics"},{"issue":"13","key":"3502_CR19","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1093\/bioinformatics\/btv130","volume":"31","author":"N Malod-Dognin","year":"2015","unstructured":"Malod-Dognin N, Pr\u017eulj N. L-GRAAL: Lagrangian graphlet-based network aligner. Bioinformatics. 2015; 31(13):2182\u20139.","journal-title":"Bioinformatics"},{"issue":"9","key":"3502_CR20","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1093\/bioinformatics\/bts119","volume":"28","author":"HT TPhan","year":"2012","unstructured":"TPhan HT, Sternberg MJE. PINALOG: A novel approach to align protein interaction networks\u2014implications for complex detection and function prediction. Bioinformatics. 2012; 28(9):1239\u201345.","journal-title":"Bioinformatics"},{"issue":"suppl 1","key":"3502_CR21","doi-asserted-by":"publisher","first-page":"D295","DOI":"10.1093\/nar\/gkq1234","volume":"39","author":"D Park","year":"2011","unstructured":"Park D, Singh R, et al.IsoBase: a database of functionally related proteins across PPI networks. Nucleic Acids Res. 2011; 39(suppl 1):D295\u2013D300.","journal-title":"Nucleic Acids Res"},{"issue":"suppl 1","key":"3502_CR22","first-page":"D646","volume":"36","author":"A Ruepp","year":"2008","unstructured":"Ruepp A, Brauner B, et al.CORUM: the comprehensive resource of mammalian protein complexes. Nucleic Acids Res. 2008; 36(suppl 1):D646\u2013D650.","journal-title":"Nucleic Acids Res"},{"issue":"7084","key":"3502_CR23","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1038\/nature04532","volume":"440","author":"A-C Gavin","year":"2006","unstructured":"Gavin A-C, Aloy P, et al.Proteome survey reveals modularity of the yeast cell machinery. Nature. 2006; 440(7084):631\u20136.","journal-title":"Nature"},{"issue":"18","key":"3502_CR24","doi-asserted-by":"publisher","first-page":"5539","DOI":"10.1093\/nar\/gkh894","volume":"32","author":"A Ruepp","year":"2004","unstructured":"Ruepp A, Zollner A, et al.The FunCat, a functional annotation scheme for systematic classification of proteins from whole genomes. Nucleic Acids Res. 2004; 32(18):5539\u201345.","journal-title":"Nucleic Acids Res"},{"key":"3502_CR25","doi-asserted-by":"publisher","first-page":"D574","DOI":"10.1093\/nar\/gkt1131","volume":"42","author":"H Luo","year":"2014","unstructured":"Luo H, Lin Y, Gao F, Zhang C-T, Zhang R. DEG 10, an update of the Database of Essential Genes that includes both protein-coding genes and non-coding genomic elements. Nucleic Acids Res. 2014; 42:D574\u2013D580.","journal-title":"Nucleic Acids Res"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-020-3502-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-020-3502-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-020-3502-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T06:03:42Z","timestamp":1605938622000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-020-3502-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":25,"journal-issue":{"issue":"S6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["3502"],"URL":"https:\/\/doi.org\/10.1186\/s12859-020-3502-1","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"13 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"265"}}