Pages that link to "Item:Q5706862"
From MaRDI portal
The following pages link to Research in Computational Molecular Biology (Q5706862):
Displaying 11 items.
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination (Q850133) (← links)
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478) (← links)
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks (Q996826) (← links)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks (Q2008245) (← links)
- Combinatorial views on persistent characters in phylogenetics (Q2182613) (← links)
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics (Q2195553) (← links)
- Unrooted non-binary tree-based phylogenetic networks (Q2656952) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- Parameterized algorithms for the Steiner arborescence problem on a hypercube (Q6659999) (← links)
