Combining Networks Using Cherry Picking Sequences
From MaRDI portal
Publication:5041128
DOI10.1007/978-3-030-42266-0_7zbMath1500.92065arXiv1912.03999OpenAlexW3013842306MaRDI QIDQ5041128
No author found.
Publication date: 13 October 2022
Published in: Algorithms for Computational Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03999
Related Items (3)
Finding agreement cherry-reduced subnetworks in level-1 networks ⋮ On cherry-picking and network containment ⋮ Novel phylogenetic network distances based on cherry picking
Cites Work
- Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
- A framework for representing reticulate evolution
- Quarnet inference rules for level-1 networks
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
- Trinets encode tree-child and level-2 phylogenetic networks
- A class of phylogenetic networks reconstructable from ancestral profiles
- Binets: fundamental building blocks for phylogenetic networks
- A quadratic kernel for computing the hybridization number of multiple trees
- Hybridization Number on Three Rooted Binary Trees is EPT
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- Leaf-Reconstructibility of Phylogenetic Networks
This page was built for publication: Combining Networks Using Cherry Picking Sequences
