arXiv (All)
open access
Best Matches in Phylogenetic Networks
Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors a
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
- Tree View: An application to display phylogenetic trees on personal computers#7082
- Multi-model approaches to phylogenetics: Implications for idealization#73448
- Selection of Conserved Blocks from Multiple Alignments for Their Use in Phylogenetic Analysis#6504
- Parallel algorithms for phylogenetic inference under a structured coalescent approximation#485372
- Parallel algorithms for phylogenetic inference under a structured coalescent approximation.#156997
Record · ID 1036091
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