山东大学教师主页朱大铭 A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations Home

Home > Scientific Research > Paper Publications

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

Release Time:2019-10-24 Hits:

Institution:计算机科学与技术学院
Journal:Journal of Computer and System Sciences
First Author:朱大铭
All the Authors:朱大铭
Document Code:lw-134846
Volume:78
Issue:4
Page Number:1099
Number of Words:8000
Translation or Not:No
Date of Publication:2012-04

Prev One:De Novo peptide sequencing based on vertex contraction algorithm

Next One:A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

Personal Information

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations