Cactus Graphs for Genome Comparisons

We introduce a data structure, analysis and visualization scheme called a cactus graph for comparing sets of related genomes Cactus graphs capture some of the advantages of de Bruijn and breakpoint graphs in one unified framework They naturally decompose the common substructures in a set of related genomes into a hierarchy of chains that can be visualized as multiple alignments and nets that can be visualized in circular genome plots.

[1]  P. Pevzner,et al.  An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Jens Stoye,et al.  On the Similarity of Sets of Permutations and Its Applications to Genome Comparison , 2006, J. Comput. Biol..

[3]  E. Birney,et al.  Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs. , 2008, Genome research.

[4]  Andrew Menzies,et al.  Architectures of somatic genomic rearrangement in human cancer amplicons at sequence-level resolution. , 2007, Genome research.

[5]  N. M. Korneyenko.  Combinatorial Algorithms on a Class of Graphs , 1994, Discret. Appl. Math..

[6]  Steven J. M. Jones,et al.  Circos: an information aesthetic for comparative genomics. , 2009, Genome research.

[7]  Daniel J. Blankenberg,et al.  28-way vertebrate alignment and conservation track in the UCSC Genome Browser. , 2007, Genome research.

[8]  Yung H. Tsin.  A Simple 3-Edge-Connected Component Algorithm , 2005, Theory of Computing Systems.

[9]  Matthew Berriman,et al.  DNAPlotter: circular and linear interactive genome visualization , 2008, Bioinform..

[10]  William Stafford Noble,et al.  Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project , 2007, Nature.

[11]  Janez Zerovnik,et al.  Estimating the traffic on weighted cactus networks in linear time , 2005, Ninth International Conference on Information Visualisation (IV'05).

[12]  Alexandre Z. Caldeira,et al.  Uncertainty in homology inferences: assessing and improving genomic sequence alignment. , 2008, Genome research.

[13]  Boaz Ben-Moshe,et al.  Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph , 2005, ISAAC.

[14]  D. Haussler,et al.  Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[15]  F Harary,et al.  On the Number of Husimi Trees: I. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[16]  P. Pevzner,et al.  Breakpoint graphs and ancestral genome reconstructions. , 2009, Genome research.

[17]  Benjamin J. Raphael,et al.  A novel method for multiple alignment of sequences with repeated and shuffled elements. , 2004, Genome research.

[18]  Tetsuo Nishi,et al.  On the number of solutions of a class of nonlinear resistive circuits , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[19]  Jens Stoye,et al.  Reversal Distance without Hurdles and Fortresses , 2004, CPM.

[20]  Sharon J. Diskin,et al.  Copy number variation at 1q21.1 associated with neuroblastoma , 2009, Nature.

[21]  Christopher A. Miller,et al.  A sequence-level map of chromosomal breakpoints in the MCF-7 breast cancer cell line yields insights into the evolution of a cancer genome. , 2009, Genome research.