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. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Paten, B., Diekhans, M., Earl, D., John, J. S., Ma, J., Suh, B., & Haussler, D. (2010). Cactus graphs for genome comparisons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6044 LNBI, pp. 410–425). https://doi.org/10.1007/978-3-642-12683-3_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
