A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations | |
Jiang H.; Wang L.; Zhu B.; Zhu D. | |
刊名 | Theoretical Computer Science
![]() |
2015 | |
卷号 | 607页码:166-180 |
关键词 | Approximation algorithms Computational genomics Genome rearrangement NP-hardness |
DOI | 10.1016/j.tcs.2015.04.036 |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4776115 |
专题 | 山东大学 |
作者单位 | 1.School of Computer Science and Technology, Shandong University, China 2.Department of Computer Science, City University of Hong Ko |
推荐引用方式 GB/T 7714 | Jiang H.,Wang L.,Zhu B.,et al. A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations[J]. Theoretical Computer Science,2015,607:166-180. |
APA | Jiang H.,Wang L.,Zhu B.,&Zhu D..(2015).A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.Theoretical Computer Science,607,166-180. |
MLA | Jiang H.,et al."A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations".Theoretical Computer Science 607(2015):166-180. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论