朱大铭山东大学主页平台管理系统--中文主页

论文成果

[111] 朱大铭 and 张鹏. Complexity and approximation results for the min-sum and min-max disjoint paths problems. Computing and Informatics, 32, 23, 2013.
[112] 朱大铭 and 姜海涛. An improved approximation algorithm for scaffold filling to maximize the common adjacencies. IEEE/ACM transactions on computational biology and bioinformatics, 10, 905, 2013.
[113] 朱大铭 and 姜海涛. An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies. 19th International Computing and Combinatorics Conference, COCOON 2013, 397, 2013.
[114] 张鹏 , 朱大铭 and 刘宏. On Editing Graphs into 2-Club Clusters. 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012, 1, 235, 2012.
[115] 朱大铭 and 姜海涛. Minimum common string partition revisited . Journal of Combinatorial Optimization, 23, 519, 2012.
[116] 冯好娣 , 朱大铭 and 赵瑾. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads. BIOINFORMATICS RESEARCH AND APPLICATIONS (ISBRA 2017), 10330, 71, 2017.
[117] DTAST: A Novel Radical Framework. Lecture notes in computer science, 2018.
[118] 朱大铭 and 冯好娣. ISOtree: A new framework for de novo transcriptome assembly from RNA-seq reads. IEEE/ACM , 2018.
[119] IsoTree: De Novo Transcriptome Assembly. 2017.
[120] 朱大铭 , 姜海涛 , 冯好娣 , 郭炅 and 张舒. The longest common exemplar subsequence problem. 2018.

共159条 12/16

首页上页下页尾页页

朱大铭

教授

性别：男

在职信息：在职

所在单位：计算机科学与技术学院

入职时间： 1990-07-01

版权所有 ©山东大学　地址：中国山东省济南市山大南路27号　邮编：250100　
查号台：（86）-0531-88395114
值班电话：（86）-0531-88364731　建设维护：山东大学信息化工作办公室　　
访问量：手机版 English 登录山东大学

最后更新时间： ..