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

Approximation algorithms for sorting by bounded singleton moves

Hits:

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

Title of Paper:Approximation algorithms for sorting by bounded singleton moves

Journal:Theoretical Computer Science

Key Words:Approximation algorithm;Bounded singleton move;Permutation

First Author:谢升军

Document Code:1539149761556307970

Number of Words:12

Translation or Not:No

Date of Publication:2022-03

Release Time:2024-06-05

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

Next One:Minimize Maximum Coverage of Fragment Alignment Selection