山东大学教师主页朱大铭 Structural neighboring property for identifying protein-protein binding sites Home

Home > Scientific Research > Paper Publications

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

Release Time:2021-06-02 Hits:

Institution:计算机科学与技术学院
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

Prev One:Multitrans: an algorithm for path extraction through mixed integer linear programming for transcriptome assembly

Next One:IsoTree: A New Framework for de novo Transcriptome Assembly from RNA-seq Reads

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

Personal Information

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