Combinatorial algorithms on a class of graphs
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Estimating the Traffic on Weighted Cactus Networks in Linear Time
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
A Simple 3-Edge-Connected Component Algorithm
Theory of Computing Systems
Bioinformatics
Efficient algorithms for the weighted 2-center problem in a cactus graph
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A simple 3-edge connected component algorithm revisited
Information Processing Letters
Hi-index | 0.00 |
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.