Personal Information

Professor

Paper Publications

[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.

total63 1/7

firstpreviousnext last Page

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