Cactus Graphs for Genome Comparisons
- 1 March 2011
- journal article
- research article
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 18 (3) , 469-481
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 .Keywords
This publication has 25 references indexed in Scilit:
- Copy number variation at 1q21.1 associated with neuroblastomaNature, 2009
- DNAPlotter: circular and linear interactive genome visualizationBioinformatics, 2008
- Multi-break rearrangements and chromosomal evolutionTheoretical Computer Science, 2008
- Architectures of somatic genomic rearrangement in human cancer amplicons at sequence-level resolutionGenome Research, 2007
- On the Similarity of Sets of Permutations and Its Applications to Genome ComparisonJournal of Computational Biology, 2006
- Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph2005
- Reversal Distance without Hurdles and Fortresses2004
- Glocal alignment: finding rearrangements during alignmentBioinformatics, 2003
- Formulations and hardness of multiple sorting by reversals1999
- Biological Sequence Analysis1998