NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
From MaRDI portal
Publication:2295760
DOI10.1016/j.jtbi.2019.110144zbMath1430.92057OpenAlexW2998635746WikidataQ92477670 ScholiaQ92477670MaRDI QIDQ2295760
Hossein Ghaneai, Mohsen Sardari Zarchi, Hadi Poormohammadi
Publication date: 17 February 2020
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2019.110144
consistencydensityNP-hardbioinformaticsheight functionrooted tripletliving speciesreticulation noderooted phylogenetic network
Uses Software
Cites Work
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Constructing the simplest possible phylogenetic network from triplets
- Phylogenetic tree and community structure from a tangled nature model
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Computing the minimum number of hybridization events for a consistent evolutionary history
- New heuristics for rooted triplet consistency
- Constructing the maximum consensus tree from rooted Triples
- Reconstruction of certain phylogenetic networks from the genomes at their leaves
- Properties of a neutral allele model with intragenic recombination
- Optimizing phylogenetic diversity under constraints
- Fast algorithm for the reconciliation of gene trees and LGT networks
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Reducibility among Combinatorial Problems
This page was built for publication: NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization