Pages that link to "Item:Q1811070"
From MaRDI portal
The following pages link to Reconstructing minimal rooted trees. (Q1811070):
Displaying 12 items.
- Reduced representations of rooted trees. (Q403794) (← links)
- Minimum triplet covers of binary phylogenetic \(X\)-trees (Q1679026) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- An efficient algorithm for supertrees (Q1901397) (← links)
- Extension operations on sets of leaf-labelled trees (Q1914784) (← links)
- Best match graphs with binary trees (Q2062000) (← links)
- Closure operations in phylogenetics (Q2382399) (← links)
- Best match graphs (Q2420450) (← links)
- Computing quadratic entropy in evolutionary trees (Q2429024) (← links)
- Recovering a phylogenetic tree using pairwise closure operations (Q2484621) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- The complexity of inferring a minimally resolved phylogenetic supertree (Q2884583) (← links)