Computing the rooted triplet distance between galled trees by counting triangles
DOI10.1007/978-3-642-31265-6_31zbMATH Open1358.05282OpenAlexW122705633MaRDI QIDQ2904512FDOQ2904512
Authors: Jesper Jansson, Andrzej Lingas 
Publication date: 14 August 2012
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_31
Recommendations
- Computing the rooted triplet distance between galled trees by counting triangles
- An efficient algorithm for the rooted triplet distance between galled trees
- Algorithms for combining rooted triplets into a galled phylogenetic network
- Computing the rooted triplet distance between phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)
Cited In (5)
- Computing the rooted triplet distance between galled trees by counting triangles
- An efficient algorithm for the rooted triplet distance between galled trees
- Computing the rooted triplet distance between phylogenetic networks
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- Enumeration of rooted binary unlabeled galled trees
This page was built for publication: Computing the rooted triplet distance between galled trees by counting triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904512)
