教授
性别：男
在职信息：在职
所在单位：计算机科学与技术学院
入职时间：2011-07-16
访问量：
最后更新时间：..
-
[41]
姜海涛 and 朱大铭.
A 14/11-approximation algorithm for sorting by short block moves.
Science China Information Science,
54,
279,
2011.
-
[42]
姜海涛.
A 2-approximation algorithm for the contigbased genomic scaffold filling problem.
生物信息学与计算生物学期刊,
16,
2018.
-
[43]
姜海涛.
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.
计算机科学汇刊,
2018.
-
[44]
朱大铭 , 姜海涛 , 冯好娣 , 郭炅 and 张舒.
The longest common exemplar subsequence problem.
2018.
-
[45]
姜海涛 and 冯好娣.
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.
Lecture Notes in Computer Science,
9711,
92,
2016.
-
[46]
朱大铭 , 姜海涛 , 郭炅 , 冯好娣 and 张舒.
Can a permutation be sorted by best short swaps?.
2018.
-
[47]
姜海涛 and 朱大铭.
A 14/11-approximation algorithm for sorting by short block moves.
Science China Information Science,
54,
279,
2011.
-
[48]
姜海涛.
Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling.
FAW2016,
2016.
-
[49]
姜海涛.
排列短块移动排序距离的新下界.
《计算机研究与发展》,
2015.
-
[50]
姜海涛.
PQ-树断点距离中心问题的复杂性和算法.
《计算机研究与发展》,
2016.
-
[51]
朱大铭 and 姜海涛.
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem..
COCOON2015,
2015.
-
[52]
姜海涛.
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations..
Theoretical Computer Science,
2015.
-
[53]
朱大铭 and 姜海涛.
Isomorphism and similarity for 2-generation pedigrees..
BMC Bioinformatics,
2015.
-
[54]
姜海涛.
On the Exact Block Cover Problem.
AAIM 2014 - The 10th International Conference on Algorithmic Aspects of Information and Management,
2014.
-
[55]
朱大铭 and 姜海涛.
A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations..
FAW 2014-8th International Frontiers of Algorithmics Workshop,
128,
2014.
-
[56]
冯好娣 and 姜海涛.
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves.
International Symposium on Algorithms and Computation (ISAAC 2014),
2014.
-
[57]
姜海涛.
A linear kernel for the complementary maximal strip recovery problem.
Journal of Computer and System Sciences,
80,
1350,
2014.
-
[58]
朱大铭 and 姜海涛.
An improved approximation algorithm for scaffold filling to maximize the common adjacencies.
IEEE/ACM transactions on computational biology and bioinformatics,
10,
905,
2013.
-
[59]
朱大铭 and 姜海涛.
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.
19th International Computing and Combinatorics Conference, COCOON 2013,
397,
2013.
-
[60]
朱大铭 and 姜海涛.
Minimum common string partition revisited .
Journal of Combinatorial Optimization,
23,
519,
2012.
-
版权所有 ©山东大学 地址：中国山东省济南市山大南路27号 邮编：250100
查号台：（86）-0531-88395114
值班电话：（86）-0531-88364731 建设维护：山东大学信息化工作办公室
-
手机版
登录 | 山东大学
