Pages that link to "Item:Q2741464"
From MaRDI portal
The following pages link to On the complexity of inferring rooted evolutinary trees (Q2741464):
Displaying 9 items.
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- The number of evolutionary steps on random and minimum length trees for random evolutionary data (Q1803904) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625) (← links)
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model (Q2784459) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- Complexity of Hierarchical Trees in Evidence Theory (Q4291498) (← links)
- Research in Computational Molecular Biology (Q5706873) (← links)