The following pages link to Computing and Combinatorics (Q5716929):
Displaying 19 items.
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982) (← links)
- Fourier calculus on evolutionary trees (Q1261858) (← links)
- Estimating the bias on the LogDeterminant transformation for evolutionary trees (Q1352343) (← links)
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree (Q1600350) (← links)
- The number of evolutionary steps on random and minimum length trees for random evolutionary data (Q1803904) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← links)
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model (Q2784459) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- (Q4004056) (← links)
- (Q4304358) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- Ancestors and descendants in evolving <i>k</i>‐tree models (Q5495877) (← links)
- Research in Computational Molecular Biology (Q5706873) (← links)
