Encodings of cladograms and labeled trees
From MaRDI portal
Publication:976699
zbMATH Open1222.05025MaRDI QIDQ976699FDOQ976699
Authors: Daniel J. Ford 
Publication date: 16 June 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222645
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On coding labeled trees
- Enumerating phylogenetic trees with multiple labels
- Encoding phylogenetic trees in terms of weighted quartets
- Phylogenetic trees and Euclidean embeddings
- LATIN 2004: Theoretical Informatics
- Labellable phylogenetic networks
- On encodings of phylogenetic networks of bounded level
- On the graph labellings arising from phylogenetics
- Phylogenetic networks from multi-labelled trees
- Recovering a phylogenetic tree using pairwise closure operations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Encodings of cladograms and labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976699)
