Pages that link to "Item:Q4327418"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed (Q4327418):
Displayed 12 items.
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Tree reconstruction from multi-state characters (Q696854) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
- Character-based phylogeny construction and its application to tumor evolution (Q2011627) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- On the Generalised Character Compatibility Problem for Non-branching Character Trees (Q5323073) (← links)
- Minimizing phylogenetic number to find good evolutionary trees (Q5961621) (← links)