arXiv (All)
open access
The phylogenetic rank of a graph
The Pachter-Sturmfels phylogenetic rank of a graph G is the minimal number of metric trees needed to embed G isometrically. Here, all edges of G are of length one and the product of metric trees is endowed with the supremum norm. We develop both a greedy and an exact algorithm for computing phylogen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dynamics of clade diversification on the morphological hypercube#639117
- Longitudinal Phylogenetic Inference of Copy Number Alterations and Single Nucleotide Variants from Single-Cell Sequencing#200149
- MrBayes 3.2: Efficient Bayesian Phylogenetic Inference and Model Choice Across a Large Model Space#6327
- Testing the validity and adequacy of linguistic phylogenetic analyses.#239605
- Maximum likelihood estimation of phylogenetic branch lengths for a star-like phylogeny#250717
Record · ID 1013968
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive