期刊
THEORETICAL COMPUTER SCIENCE
卷 410, 期 51, 页码 5300-5316出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2009.09.008
关键词
Comparative genomics; Genome rearrangements; Genomic distance computation; Sorting by translocations, fusions, fissions and inversions
资金
- Alexander von Humboldt Foundation
- Bundesministerium fur Bildung und Forschung
The genomic distance problem in the Hannenhalli-Pevzner (HP) theory is the following: Given two genomes whose chromosomes are linear, calculate the minimum number of translocations, fusions, fissions and inversions that transform one genome into the other. This paper presents a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a unifying way, and a linear time algorithm for computing this distance. (C) 2009 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据