{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:54:34Z","timestamp":1762624474062},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"S13","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"vor","delay-in-days":16,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Network alignment is an efficient computational framework in the prediction of protein function and phylogenetic relationships in systems biology. However, most of existing alignment methods focus on aligning PPIs based on static network model, which are actually dynamic in real-world systems. The dynamic characteristic of PPI networks is essential for understanding the evolution and regulation mechanism at the molecular level and there is still much room to improve the alignment quality in dynamic networks.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>In this paper, we proposed a novel alignment algorithm, Twadn, to align dynamic PPI networks based on a strategy of time warping. We compare Twadn with the existing dynamic network alignment algorithm DynaMAGNA++ and DynaWAVE and use area under the receiver operating characteristic curve and area under the precision-recall curve as evaluation indicators. The experimental results show that Twadn is superior to DynaMAGNA++ and DynaWAVE. In addition, we use protein interaction network of Drosophila to compare Twadn and the static network alignment algorithm NetCoffee2 and experimental results show that Twadn is able to capture timing information compared to NetCoffee2.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>Twadn is a versatile and efficient alignment tool that can be applied to dynamic network. Hopefully, its application can benefit the research community in the fields of molecular function and evolution.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-020-03672-6","type":"journal-article","created":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:03:04Z","timestamp":1600300984000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks"],"prefix":"10.1186","volume":"21","author":[{"given":"Yuanke","family":"Zhong","sequence":"first","affiliation":[]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Junhao","family":"He","sequence":"additional","affiliation":[]},{"given":"Yiqun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jingru","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xuequn","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Jialu","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"3672_CR1","doi-asserted-by":"crossref","unstructured":"Zhong Y, Li J, Liu J, Zheng Y, Shang X, Hu J. Deep learning enables accurate alignment of single cell rna-seq data In: Yoo I, Bi J, Hu J, editors. 2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). New York: IEEE. p. 778\u201381. https:\/\/doi.org\/10.1109\/BIBM47256.2019.8982969.","DOI":"10.1109\/BIBM47256.2019.8982969"},{"key":"3672_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/s12859-018-2580-9","volume":"20","author":"JL Hu","year":"2019","unstructured":"Hu JL, Wang JR, Lin JA, Liu TW, Zhong YK, Liu J, Zheng Y, Gao YQ, He JH, Shang XQ. Md-svm: a novel svm-based algorithm for the motif discovery of transcription factor binding sites. BMC Bioinformatics. 2019; 20:8. https:\/\/doi.org\/10.1186\/s12859-019-2735-3.","journal-title":"BMC Bioinformatics"},{"key":"3672_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3389\/fgene.2019.00007","volume":"10","author":"JL Hu","year":"2019","unstructured":"Hu JL, Gao YQ, Li J, Shang XQ. Deep learning enables accurate prediction of interplay between lncrna and disease. Front Genet. 2019; 10:7. https:\/\/doi.org\/10.3389\/fgene.2019.00937.","journal-title":"Front Genet"},{"key":"3672_CR4","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1186\/s12859-019-3128-3","volume":"20","author":"JL Hu","year":"2019","unstructured":"Hu JL, Gao YQ, Li J, Zheng Y, Wang JR, Shang XQ. A novel algorithm based on bi-random walks to identify disease-related lncrnas. BMC Bioinformatics. 2019; 20:569. https:\/\/doi.org\/10.1186\/s12859-019-3128-3.","journal-title":"BMC Bioinformatics"},{"issue":"Suppl. 13","key":"3672_CR5","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1186\/s12864-019-6302-0","volume":"20","author":"J Hu","year":"2019","unstructured":"Hu J, He J, Li J, Gao Y, Zheng Y, Shang X. A novel algorithm for alignment of multiple ppi networks based on simulated annealing. BMC Genomics. 2019; 20(Suppl. 13):932. https:\/\/doi.org\/10.1186\/s12864-019-6302-0.","journal-title":"BMC Genomics"},{"issue":"3","key":"3672_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s41019-018-0070-8","volume":"3","author":"LEAXJSea Oentaryo","year":"2018","unstructured":"Oentaryo LEAXJSea RJ. Talent flow analytics in online professional network. Data Sci Eng. 2018; 3(3):199\u2013220. https:\/\/doi.org\/10.1007\/s41019-018-0070-8.","journal-title":"Data Sci Eng"},{"issue":"3","key":"3672_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1093\/bioinformatics\/btu652","volume":"31","author":"JL Hu","year":"2015","unstructured":"Hu JL, Reinert K. Localali: an evolutionary-based local alignment approach to identify functionally conserved modules in multiple networks. Bioinformatics. 2015; 31(3):363\u201372. https:\/\/doi.org\/10.1093\/bioinformatics\/btu652.","journal-title":"Bioinformatics"},{"issue":"14","key":"3672_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1093\/bioinformatics\/btx246","volume":"33","author":"V Vijayan","year":"2017","unstructured":"Vijayan V, Critchlow D, Milenkovic T. Alignment of dynamic networks. Bioinformatics. 2017; 33(14):180\u20139. https:\/\/doi.org\/10.1093\/bioinformatics\/btx246.","journal-title":"Bioinformatics"},{"issue":"4","key":"3672_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/s12918-018-0566-x","volume":"12","author":"JL Hu","year":"2018","unstructured":"Hu JL, Gao YQ, Zheng Y, Shang XQ. Kf-finder: identification of key factors from host-microbial networks in cervical cancer. BMC Syst Biol. 2018; 12(4):54. https:\/\/doi.org\/10.1186\/s12918-018-0566-x.","journal-title":"BMC Syst Biol"},{"issue":"12","key":"3672_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3390\/molecules22122194","volume":"22","author":"JL Hu","year":"2017","unstructured":"Hu JL, Shang XQ. Detection of network motif based on a novel graph canonization algorithm from transcriptional regulation networks. Molecules. 2017; 22(12):9. https:\/\/doi.org\/10.3390\/molecules22122194.","journal-title":"Molecules"},{"issue":"4","key":"3672_CR11","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1093\/bioinformatics\/btt715","volume":"30","author":"JL Hu","year":"2014","unstructured":"Hu JL, Kehr B, Reinert K. Netcoffee: a fast and accurate global alignment approach to identify functionally conserved proteins in multiple networks. Bioinformatics. 2014; 30(4):540\u20138. https:\/\/doi.org\/10.1093\/bioinformatics\/btt715.","journal-title":"Bioinformatics"},{"issue":"4","key":"3672_CR12","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1093\/bioinformatics\/btm630","volume":"24","author":"M Kalaev","year":"2008","unstructured":"Kalaev M, Smoot M, Ideker T, Sharan R. Networkblast: comparative analysis of protein networks. Bioinformatics. 2008; 24(4):594\u20136. https:\/\/doi.org\/10.1093\/bioinformatics\/btm630.","journal-title":"Bioinformatics"},{"issue":"13","key":"3672_CR13","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1093\/bioinformatics\/btt202","volume":"29","author":"N Behnam","year":"2013","unstructured":"Behnam N, Ahmadreza K, Somaye H, Seyed Shahriar A. Netal: a new graph-based method for global alignment of protein-protein interaction networks. Bioinformatics. 2013; 29(13):1654\u201362. https:\/\/doi.org\/10.1093\/bioinformatics\/btt202.","journal-title":"Bioinformatics"},{"key":"3672_CR14","volume-title":"Adaptive Optics Systems V. vol. 9909","author":"J Paufique","year":"2016","unstructured":"Paufique J, Madec PY, Kolb J, Kiekebusch MJ, Arsenault R, Siebenmorgen R, Downing M, Hibon P, Valenzuela JJ, Haguenauer P. Graal on the mountaintop. In: Adaptive Optics Systems V. vol. 9909. Bellingham: SPIE: 2016. p. 806\u201320. https:\/\/doi.org\/10.1117\/12.2232826."},{"issue":"20","key":"3672_CR15","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1093\/bioinformatics\/btu409","volume":"30","author":"V Saraph","year":"2014","unstructured":"Saraph V, Milenkovic T. Magna: Maximizing accuracy in global network alignment. Bioinformatics. 2014; 30(20):2931\u201340. https:\/\/doi.org\/10.1093\/bioinformatics\/btu409.","journal-title":"Bioinformatics"},{"issue":"14","key":"3672_CR16","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1093\/bioinformatics\/btv161","volume":"31","author":"V Vijayan","year":"2015","unstructured":"Vijayan V, Saraph V, Milenkovic T. Magna++: Maximizing accuracy in global network alignment via both node and edge conservation. Bioinformatics. 2015; 31(14):2409\u201311. https:\/\/doi.org\/10.1093\/bioinformatics\/btv161.","journal-title":"Bioinformatics"},{"issue":"12","key":"3672_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1093\/bioinformatics\/btp203","volume":"25","author":"L Chung-Shou","year":"2009","unstructured":"Chung-Shou L, Kanghao L, Michael B, Rohit S, Bonnie B. Isorankn: spectral methods for global alignment of multiple protein networks. Bioinformatics. 2009; 25(12):253\u20138. https:\/\/doi.org\/10.1093\/bioinformatics\/btp203.","journal-title":"Bioinformatics"},{"issue":"7","key":"3672_CR18","doi-asserted-by":"publisher","first-page":"67995","DOI":"10.1371\/journal.pone.0067995","volume":"8","author":"SM Sahraeian","year":"2013","unstructured":"Sahraeian SM, Yoon BJ. Smetana: accurate and scalable algorithm for probabilistic alignment of large-scale biological networks. Plos ONE. 2013; 8(7):67995. https:\/\/doi.org\/10.1371\/journal.pone.0067995.","journal-title":"Plos ONE"},{"issue":"5","key":"3672_CR19","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/TCBB.2017.2740381","volume":"15","author":"V Vijayan","year":"2018","unstructured":"Vijayan V, Milenkovi\u0107 T. Multiple network alignment via multimagna++. IEEE\/ACM Trans Comput Biol Bioinforma. 2018; 15(5):1669\u201382.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"10","key":"3672_CR20","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1093\/bioinformatics\/btx841","volume":"34","author":"V Vijayan","year":"2017","unstructured":"Vijayan V, Milenkovic T. Aligning dynamic networks with dynawave. Bioinformatics. 2017; 34(10):1795\u20138. https:\/\/doi.org\/10.1093\/bioinformatics\/btx841.","journal-title":"Bioinformatics"},{"key":"3672_CR21","volume-title":"Intelligent Computing Theories and Application, Pt Ii, Lecture Notes in Computer Science, vol. 10955","author":"JL Hu","year":"2018","unstructured":"Hu JL, He JH, Gao YQ, Zheng Y, Shang XQ. Netcoffee2: A novel global alignment algorithm for multiple ppi networks based on graph feature vectors In: Huang DS, Jo KH, Zhang XL, editors. Intelligent Computing Theories and Application, Pt Ii, Lecture Notes in Computer Science, vol. 10955. Cham: Springer: 2018. p. 241\u20136."},{"issue":"3","key":"3672_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic local alignment search tool. J Mol Biol. 1990; 215(3):403\u201310. https:\/\/doi.org\/10.1016\/S0022-2836(05)80360-2.","journal-title":"J Mol Biol."},{"issue":"9","key":"3672_CR23","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme P. Modern temporal network theory: a colloquium. Eur Phys J B. 2015; 88(9):234. https:\/\/doi.org\/10.1140\/epjb\/e2015-60657-4.","journal-title":"Eur Phys J B"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-020-03672-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-020-03672-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-020-03672-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T22:54:09Z","timestamp":1723589649000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-020-03672-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":23,"journal-issue":{"issue":"S13","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["3672"],"URL":"https:\/\/doi.org\/10.1186\/s12859-020-03672-6","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"17 September 2020","order":1,"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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"385"}}