0CPIHa57ovXpkN9pptyocq6fb8qo5lxgENSt9115hIR2Qw1Eu40nvge6bCiv

Paper Publications

Home >> Scientific Research >> Paper Publications

An approximation algorithm for genome sorting by reversals to recover all adjacencies

Release Time:2019-11-28| Hits:

Institution:软件学院

Title of Paper:An approximation algorithm for genome sorting by reversals to recover all adjacencies

Journal:JournalofCombinatorialOptimization

First Author:翟姗姗

All the Authors:Peng Zhang,朱大铭

Document Code:F51569D3CBD641219DE210C645293E23

Volume:37

Issue:4

Page Number:1170

Number of Words:14

Translation or Not:No

Date of Publication:2019-05

Release Time:2019-11-28

Prev One:
Minimum label s-t cut has large integrality gaps
Next One:
On the generalized multiway cut in trees problem

中文    |   MOBILE Version   |   Login   |   SDU   

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

The Open Time: --

The Last Update Time: --