Pages that link to "Item:Q1775773"
From MaRDI portal
The following pages link to Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773):
Displaying 15 items.
- All that glisters is not galled (Q733254) (← links)
- 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)
- An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations (Q987779) (← links)
- Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (Q1026186) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Algorithms for visualizing phylogenetic networks (Q2192379) (← links)
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances (Q2197914) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338) (← links)
- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array (Q5445764) (← links)
- Research in Computational Molecular Biology (Q5706862) (← links)
- Research in Computational Molecular Biology (Q5706869) (← links)
- Enumeration of rooted binary unlabeled galled trees (Q6124365) (← links)
