Pages that link to "Item:Q4376199"
From MaRDI portal
The following pages link to A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (Q4376199):
Displayed 13 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)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← 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)
- Sharp upper and lower bounds on a restricted class of convex characters (Q2121794) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples (Q6077980) (← links)
- (Q6089669) (← links)