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

Can a permutation be sorted by best short swaps?

Hits:

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

Title of Paper:Can a permutation be sorted by best short swaps?

Journal:29th Annual Symposium on Combinatorial Pattern Matching

First Author:张舒,张舒

All the Authors:朱大铭,姜海涛,郭炅,Feng Haodi

Document Code:B4129B94DF3946BB95E8200E160ED1B0

Translation or Not:No

Date of Publication:2018-07

Release Time:2019-10-25

Prev One:A 14/11-approximation algorithm for sorting by short block moves

Next One:A 2-approximation algorithm for the contigbased genomic scaffold filling problem