Qx0p4UNzbyUUkHy3Q5fk5sEYL5RkMUtLDIb2VROT5JPzCCBQ007z2HPOfAeK
zhudaming

Personal Information

Gender:Male
Date of Employment:1990-07-01

VIEW MORE
Home > Scientific Research > Paper Publications

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding

Release Time:2020-06-10 Hits:

Institution:计算机科学与技术学院
Journal:15th International Symposium on Bioinformatics Research and Applications
First Author:姜海涛
Document Code:01549E36DFF24098A7199C9585F6CBB5
Number of Words:10
Translation or Not:No
Date of Publication:2019-06

Prev One:A 1.375-approximation algorithm for unsigned translocation sorting

Next One:Can a breakpoint graph be decomposed into none other than 2-cycles?

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:  | The Last Update Time:..  | Login | SDU