LsdcH5DVz2mqlqOqB6eGjK9xHfKAuT31SV2a1tq8nFVqf3cJgfRc5dXw0IKo
Current position: Home >> Scientific Research >> Paper Publications

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

Hits:

Institution:计算机科学与技术学院

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

Journal:15th International Symposium on Bioinformatics Research and Applications

First Author:姜海涛

All the Authors:朱大铭

Document Code:01549E36DFF24098A7199C9585F6CBB5

Number of Words:10

Translation or Not:No

Date of Publication:2019-06

Release Time:2020-06-10

Prev One:Breakpoint distance and PQ-trees

Next One:Breakpoint distance and PQ-trees