Pages that link to "Item:Q1125442"
From MaRDI portal
The following pages link to On the linear-cost subtree-transfer distance between phylogenetic trees (Q1125442):
Displaying 13 items.
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Distribution and asymptotic behavior of the phylogenetic transfer distance (Q2313956) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- (Q5111799) (← links)
- APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES (Q5249276) (← links)
- Subtree transfer operations and their induced metrics on evolutionary trees (Q5939205) (← links)
