Browsing by Author Nguyen, Trong Dong

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • 228-1-979-5-10-20190624.pdf.jpg
  • Article


  • Authors: Vu, Thi Ngoc Anh; Nguyen, Trong Dong; Nguyen, Vu Hoang Vuong; Dang, Thanh Hai; Do, Duc Dong (2019)

  • Aligning protein-protein interaction networks from different species is a useful mechanism for figuring out orthologous proteins, predicting/verifying protein unknown functions or constructing evolutionary relationships. The network alignment problem is proved to be NP-hard, requiring exponential-time algorithms, which is not feasible for the fast growth of biological data. In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore,...

Browsing by Author Nguyen, Trong Dong

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • 228-1-979-5-10-20190624.pdf.jpg
  • Article


  • Authors: Vu, Thi Ngoc Anh; Nguyen, Trong Dong; Nguyen, Vu Hoang Vuong; Dang, Thanh Hai; Do, Duc Dong (2019)

  • Aligning protein-protein interaction networks from different species is a useful mechanism for figuring out orthologous proteins, predicting/verifying protein unknown functions or constructing evolutionary relationships. The network alignment problem is proved to be NP-hard, requiring exponential-time algorithms, which is not feasible for the fast growth of biological data. In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore,...