Pages that link to "Item:Q820142"

The following pages link to Compatibility of unrooted phylogenetic trees is FPT (Q820142):

Displaying 20 items.

• Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
• Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
• Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
• Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
• Treewidth distance on phylogenetic trees (Q1637220) (← links)
• On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
• Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170) (← links)
• Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
• Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
• Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• On the ancestral compatibility of two phylogenetic trees with nested taxa (Q2433022) (← links)
• On Low Treewidth Graphs and Supertrees (Q2941748) (← links)
• Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
• Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
• The agreement problem for unrooted phylogenetic trees is FPT (Q5494863) (← links)
• On the quartet distance given partial information (Q6081560) (← links)
• Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
• Composing dynamic programming tree-decomposition-based algorithms (Q6606983) (← links)