Cactus graphs for genome comparisons

Benedict Paten, Mark Diekhans, Dent Earl, John St John, Jian Ma, Bernard Suh, David Haussler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationResearch in Computational Molecular Biology - 14th Annual International Conference, RECOMB 2010, Proceedings
Pages410-425
Number of pages16
DOIs
StatePublished - Dec 23 2010
Event14th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2010 - Lisbon, Portugal
Duration: Apr 25 2010Apr 28 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6044 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2010
CountryPortugal
CityLisbon
Period4/25/104/28/10

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Paten, B., Diekhans, M., Earl, D., John, J. S., Ma, J., Suh, B., & Haussler, D. (2010). Cactus graphs for genome comparisons. In Research in Computational Molecular Biology - 14th Annual International Conference, RECOMB 2010, Proceedings (pp. 410-425). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6044 LNBI). https://doi.org/10.1007/978-3-642-12683-3_27