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

PQ-树断点距离中心问题的复杂性和算法

Hits:

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

Title of Paper:PQ-树断点距离中心问题的复杂性和算法

Journal:《计算机研究与发展》

First Author:姜海涛

All the Authors:姜海涛

Document Code:lw-185496

Number of Words:5

Translation or Not:No

Date of Publication:2016-03

Release Time:2019-10-24

Prev One:The longest common exemplar subsequence problem

Next One:A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.