most citedFair Evaluation of Global Network Aligners

4 citations · 7 across the 3 of their papers we have counts for

collaborators

5 papers

cs.DC20245 cited

PASGAL: Parallel And Scalable Graph Algorithm Library

Xiaojun Dong, Yan Gu, Yihan Sun +1

In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a parallel graph library that scales to a variety of graph types, many processors, and large gra…

cs.DS20232 cited

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems

Xiaojun Dong, Yunshu Wu, Zhongqi Wang +3

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extrac…

cs.DC202311 cited

Parallel Strong Connectivity Based on Faster Reachability

Letong Wang, Xiaojun Dong, Yan Gu +1

Computing strongly connected components (SCC) is a fundamental problems in graph processing. As today's real-world graphs are getting larger and larger, parallel SCC is increasingl…

q-bio.MN20141 cited

Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE

Yihan Sun, Joseph Crawford, Jie Tang +1

Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to comput…

q-bio.MN20144 cited

Fair Evaluation of Global Network Aligners

Joseph Crawford, Yihan Sun, Tijana Milenković

Biological network alignment identifies topologically and functionally conserved regions between networks of different species. It encompasses two algorithmic steps: node cost func…