The following pages link to Vincent Berry (Q292677):
Displaying 19 items.
- Inferring gene duplications, transfers and losses can be done in a discrete framework (Q292678) (← links)
- (Q553330) (redirect page) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort (Q856273) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction. (Q1566634) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- A structured family of clustering and tree construction methods (Q1604343) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem (Q3506929) (← links)
- From Gene Trees to Species Trees through a Supertree Approach (Q3618625) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- (Q4364582) (← links)
- (Q4938781) (← links)
- (Q4952631) (← links)
- Linear time 3-approximation for the MAST problem (Q4962789) (← links)
- Combinatorial Pattern Matching (Q5315328) (← links)
- Computing and Combinatorics (Q5716929) (← links)
