教授
性别：男
在职信息：在职
所在单位：计算机科学与技术学院
入职时间：2011-07-16
访问量：
最后更新时间：..
-
[1]
马静静.
Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.
IEEE/ACM ,
19,
2071-2079,
2022.
-
[2]
徐慧秀.
On Sorting by Flanked Transpositions.
14248 LNBI,
292-311,
2023.
-
[3]
孙骋程.
An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
86-91,
2021.
-
[4]
谢升军.
Approximation algorithms for sorting by bounded singleton moves.
Theoretical Computer Science,
2022.
-
[5]
王雨阳.
Minimize Maximum Coverage of Fragment Alignment Selection.
2023.
-
[6]
周培衍.
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Theoretical Computer Science,
888,
22-30,
2021.
-
[7]
蒲莲蓉.
Can a breakpoint graph be decomposed into none other than 2-cycles?.
Theoretical Computer Science,
2018.
-
[8]
周培衍.
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Theoretical Computer Science,
888,
22,
2021.
-
[9]
张舒.
Sorting a Permutation by Best Short Swaps.
Algorithmica (New York),
2021.
-
[10]
马静静.
On the solution bound of two-sided scaffold filling.
Theoretical Computer Science,
873,
47,
2021.
-
[11]
蒲莲容.
A 1.375-approximation algorithm for unsigned translocation sorting.
Journal of Computer and System Sciences,
113,
163,
2020.
-
[12]
刘李鑫.
Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.
JOURNAL OF COMPUTATIONAL BIOLOGY,
27,
200,
2020.
-
[13]
姜海涛.
Breakpoint distance and PQ-trees.
INFORMATION AND COMPUTATION,
275,
2020.
-
[14]
朱大铭 and 姜海涛.
Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding.
2019.
-
[15]
刘宏 and 姜海涛.
Breakpoint distance and PQ-trees.
INFORMATION AND COMPUTATION,
2020.
-
[16]
蒲莲容.
Can a breakpoint graph be decomposed into none other than 2-cycles?.
Theor Comput Sci,
734,
38,
2018.
-
[17]
朱大铭 and 姜海涛.
A 14/11-approximation algorithm for sorting by short block moves.
Science China Information Science,
54,
279,
2011.
-
[18]
张舒 , 朱大铭 , 姜海涛 , 郭炅 and 冯好娣.
Can a permutation be sorted by best short swaps?.
2018.
-
[19]
姜海涛.
A 2-approximation algorithm for the contigbased genomic scaffold filling problem.
生物信息学与计算生物学期刊,
16,
2018.
-
[20]
姜海涛.
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.
计算机科学汇刊,
2018.
-
版权所有 ©山东大学 地址：中国山东省济南市山大南路27号 邮编：250100
查号台：（86）-0531-88395114
值班电话：（86）-0531-88364731 建设维护：山东大学信息化工作办公室
-
手机版
登录 | 山东大学
