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

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

Hits:

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

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

Journal:JOURNAL OF COMPUTATIONAL BIOLOGY

First Author:刘李鑫

Document Code:ABD61BA189A8432BA9A8464DBFE649B3

Volume:27

Issue:2

Page Number:200

Number of Words:10

Translation or Not:No

Date of Publication:2020-02

Release Time:2021-06-01

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

Next One:Breakpoint distance and PQ-trees