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

Approximation algorithms for sorting by bounded singleton moves

Hits:

Affiliation of Author(s):计算机科学与技术学院

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-18

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

Next One:Minimize Maximum Coverage of Fragment Alignment Selection