A cubic-time algorithm for computing the trinet distance between level-1 networks
From MaRDI portal
Publication:522967
DOI10.1016/j.ipl.2017.03.002zbMath1407.92096arXiv1703.05097OpenAlexW2597301589MaRDI QIDQ522967
James Oldman, Taoyang Wu, Vincent L. Moulton
Publication date: 20 April 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05097
Analysis of algorithms (68W40) Problems related to evolution (92D15) Software, source code, etc. for problems pertaining to biology (92-04)
Related Items (1)
Cites Work
- Unnamed Item
- New common ancestor problems in trees and directed acyclic graphs
- Optimal algorithms for comparing trees with labeled leaves
- Comparison of phylogenetic trees
- Trinets encode tree-child and level-2 phylogenetic networks
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Computing the rooted triplet distance between galled trees by counting triangles
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
This page was built for publication: A cubic-time algorithm for computing the trinet distance between level-1 networks