arXiv (All)
open access
A Crawling Metric on the Space of Subtrees of a Tree
We propose a crawling metric on the space of subtrees of a tree. The symmetric difference cannot tell whether two disjoint subtrees are close or far; we halve it and add the gap between them. The result is a metric, one half is the smallest factor, and the tree embeds canonically. The metric equals
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
- Faster algorithms for approximating combinatorial and geometric data#213219
- An Alternative Construction of Internodons: The Emergence of a Multi-level Tree of Life#115837
- PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees#226027
- Private Computation of Phylogenetic Trees Based on Quantum Technologies#679209
- MRBAYES: Bayesian inference of phylogenetic trees#6353
Record · ID 1389394
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