arXiv (All)
open access
The parental parsimony problem on binary, tree-child phylogenetic networks
Phylogenetic reconstruction is one of the major challenges in computational biology. Among existing reconstruction methods for phylogenetic networks, an important subtask emerges in extending a leaf-labelling on a phylogenetic network to determine a most parsimonious tree inside the network. There e
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
- The neighbor-joining method: a new method for reconstructing phylogenetic trees.#6268
- Tree View: An application to display phylogenetic trees on personal computers#7082
- IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era#6426
- High-precision binary trait association on phylogenetic trees.#420964
- Parallel algorithms for phylogenetic inference under a structured coalescent approximation#485372
Record · ID 1036730
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