Your browser doesn't support javascript.
loading
Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks.
Zhong, Yuanke; Li, Jing; He, Junhao; Gao, Yiqun; Liu, Jie; Wang, Jingru; Shang, Xuequn; Hu, Jialu.
Affiliation
  • Zhong Y; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Li J; Xi'an Mingde Institute of Technology, Fenghe Campus, Fenghe Campus, Xi'an, 710124, China.
  • He J; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Gao Y; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Liu J; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Wang J; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Shang X; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China.
  • Hu J; School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi'an, 710072, China. jhu@nwpu.edu.cn.
BMC Bioinformatics ; 21(Suppl 13): 385, 2020 Sep 17.
Article in En | MEDLINE | ID: mdl-32938373
ABSTRACT

BACKGROUND:

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.

RESULTS:

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.

CONCLUSIONS:

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.
Subject(s)
Key words

Full text: 1 Collection: 01-internacional Database: MEDLINE Main subject: Algorithms / Proteins / Computational Biology / Drosophila / Protein Interaction Maps Type of study: Prognostic_studies Limits: Animals / Humans Language: En Journal: BMC Bioinformatics Journal subject: INFORMATICA MEDICA Year: 2020 Document type: Article Affiliation country: China

Full text: 1 Collection: 01-internacional Database: MEDLINE Main subject: Algorithms / Proteins / Computational Biology / Drosophila / Protein Interaction Maps Type of study: Prognostic_studies Limits: Animals / Humans Language: En Journal: BMC Bioinformatics Journal subject: INFORMATICA MEDICA Year: 2020 Document type: Article Affiliation country: China