Pages that link to "Item:Q4305354"

The following pages link to Inferring Evolutionary History From DNA Sequences (Q4305354):

Displaying 16 items.

• A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
• Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
• Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
• Sublinear approximate string matching and biological applications (Q1336963) (← 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)
• Listing all potential maximal cliques of a graph (Q1605302) (← links)
• Efficient approximation of convex recolorings (Q2643731) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
• A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
• Two strikes against perfect phylogeny (Q5204323) (← links)
• On the Generalised Character Compatibility Problem for Non-branching Character Trees (Q5323073) (← links)
• Minimizing phylogenetic number to find good evolutionary trees (Q5961621) (← links)