| Literature DB >> 21385048 |
Benedict Paten1, Mark Diekhans, Dent Earl, John St John, Jian Ma, Bernard Suh, David Haussler.
Abstract
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 .Entities:
Mesh:
Substances:
Year: 2011 PMID: 21385048 PMCID: PMC8884192 DOI: 10.1089/cmb.2010.0252
Source DB: PubMed Journal: J Comput Biol ISSN: 1066-5277 Impact factor: 1.479