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

An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes

Hits:

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

Title of Paper:An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes

Journal:2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

First Author:孙骋程

Document Code:1601080644622094337

Page Number:86-91

Number of Words:10

Translation or Not:No

Date of Publication:2021-12

Release Time:2024-06-05

Prev One:On Sorting by Flanked Transpositions

Next One:Approximation algorithms for sorting by bounded singleton moves