Pages that link to "Item:Q2465625"
From MaRDI portal
The following pages link to On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625):
Displaying 3 items.
- Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)