Keywords
Phylogenetic treePhylogenetic networkComputer scienceTree (set theory)Set (abstract data type)DecompositionTheoretical computer scienceAlgorithmCombinatoricsMathematicsBiologyGene
Affiliated Institutions
Related Publications
Colored de Bruijn Graphs and the Genome Halving Problem
Breakpoint graph analysis is a key algorithmic technique in studies of genome rearrangements. However, breakpoint graphs are defined only for genomes without duplicated genes, t...
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to fin...
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
Abstract Motivation Phylogenies are important for fundamental biological research, but also have numerous applications in biotechnology, agriculture and medicine. Finding the op...
OrthoFinder: phylogenetic orthology inference for comparative genomics
Abstract Here, we present a major advance of the OrthoFinder method. This extends OrthoFinder’s high accuracy orthogroup inference to provide phylogenetic inference of orthologs...
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction metho...
Publication Info
- Year
- 2005
- Type
- book-chapter
- Pages
- 217-232
- Citations
- 69
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
69
OpenAlex
Cite This
Dan Gusfield,
Vikas Bansal
(2005).
A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters.
Lecture notes in computer science
, 217-232.
https://doi.org/10.1007/11415770_17
Identifiers
- DOI
- 10.1007/11415770_17