Pages that link to "Item:Q991797"
From MaRDI portal
The following pages link to New common ancestor problems in trees and directed acyclic graphs (Q991797):
Displaying 7 items.
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Tree-metrizable HGT networks (Q2173881) (← links)
- Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
- Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks (Q2304069) (← links)