期刊
JOURNAL OF COMPUTATIONAL BIOLOGY
卷 18, 期 3, 页码 469-481出版社
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2010.0252
关键词
algorithms; cancer genomics; genomic rearrangements; sequence analysis
类别
资金
- NHGRI NIH HHS [U41 HG007234] Funding Source: Medline
We introduce a data structure, analysis, and visualization scheme called a cactus graph for comparing sets of related genomes. In common with multi-break point graphs and A-Bruijn graphs, cactus graphs can represent duplications and general genomic rearrangements, but additionally, they naturally decompose the common substructures in a set of related genomes into a hierarchy of chains that can be visualized as two-dimensional multiple alignments and nets that can be visualized in circular genome plots. Supplementary Material is available at www.liebertonline.com/cmb.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据