Scientific Research
-
马静静.
Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.
IEEE/ACM ,
19,
2071-2079,
2024.
-
徐慧秀.
On Sorting by Flanked Transpositions.
14248 LNBI,
292-311,
2024.
-
孙骋程.
An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
86-91,
2024.
-
谢升军.
Approximation algorithms for sorting by bounded singleton moves.
Theoretical Computer Science,
2024.
-
王雨阳.
Minimize Maximum Coverage of Fragment Alignment Selection.
2024.
-
周培衍.
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Theoretical Computer Science,
888,
22-30,
2023.
