Pages that link to "Item:Q860811"

The following pages link to Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811):

Displaying 3 items.

• Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
• Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
• A survey on pairwise compatibility graphs (Q5012383) (← links)