Pages that link to "Item:Q2576441"
From MaRDI portal
The following pages link to An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441):
Displaying 6 items.
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← links)
- Testing the theory of evolution: A novel application of combinatorial optimization (Q1084042) (← links)
- Fast computation of maximum likelihood trees by numerical approximation of amino acid replacement probabilities (Q1608904) (← links)
- Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
- Finding a maximum likelihood tree is hard (Q3455214) (← links)
- Research in Computational Molecular Biology (Q5706873) (← links)