Personal Information

Professor

Paper Publications

[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] zhudaming and jianghaitao. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding. 2019.
[15] Liu Hong and jianghaitao. 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] zhudaming and jianghaitao. A 14/11-approximation algorithm for sorting by short block moves. Science China Information Science, 54, 279, 2011.
[18] zhangshu , zhudaming , jianghaitao , guogui , Feng Haodi and 张舒. Can a permutation be sorted by best short swaps?. 2018.
[19] jianghaitao. A 2-approximation algorithm for the contigbased genomic scaffold filling problem. 生物信息学与计算生物学期刊, 16, 2018.
[20] jianghaitao. A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applica.... 计算机科学汇刊, 2018.

total63 2/7

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click:Times MOBILE Version
The Founding Time : ..
The Last Update Time : ..

Mobile phone sweep

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

Personal Information

Paper Publications