The following pages link to Oliver Eulenstein (Q659786):
Displaying 14 items.
- Groves of phylogenetic trees (Q659789) (← links)
- A scalable parallelization of the gene duplication problem (Q666045) (← links)
- (Q1281763) (redirect page) (← links)
- On the equivalence of two tree mapping measures (Q1281765) (← links)
- Mathematical properties of the gene duplication cost (Q1732105) (← links)
- Cophenetic distances: a near-linear time algorithmic framework (Q1790966) (← links)
- Solving the gene duplication feasibility problem in linear time (Q1790995) (← links)
- Feasibility algorithms for the duplication-loss cost (Q2300042) (← links)
- Highly Bi-Connected Subgraphs for Computational Protein Function Annotation (Q2817900) (← links)
- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms (Q2914355) (← links)
- Reconciling Gene Trees with Apparent Polytomies (Q3591344) (← links)
- (Q4375732) (← links)
- (Q4808660) (← links)
- (Q5091736) (← links)
