Pages that link to "Item:Q876478"
From MaRDI portal
The following pages link to An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478):
Displaying 15 items.
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- All that glisters is not galled (Q733254) (← links)
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination (Q850133) (← links)
- A new recombination lower bound and the minimum perfect phylogenetic forest problem (Q1029702) (← links)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- Counting phylogenetic networks with few reticulation vertices: a second approach (Q2166221) (← links)
- When two trees go to war (Q2261656) (← links)
- Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections (Q5026978) (← links)
- Clustered SplitsNetworks (Q5505684) (← links)
- Research in Computational Molecular Biology (Q5706862) (← links)
- Research in Computational Molecular Biology (Q5706907) (← links)
- Book review of: D. Gusfield, ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks (Q5890694) (← links)
