期刊
JOURNAL OF COMPUTATIONAL BIOLOGY
卷 17, 期 9, 页码 1129-1144出版社
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2010.0126
关键词
computational molecular biology; dynamic programming; genomic rearrangements
In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios between two genomes. This problem is related to the uniform generation of rearrangement scenarios and the derivation of tests of statistical significance of the properties of these scenarios. Here we give an exact formula for the number of double-cut-and-join (DCJ) rearrangement scenarios between two genomes. We also construct effective bijections between the set of scenarios that sort a component as well studied combinatorial objects such as parking functions, labeled trees, and prufer codes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据