From Gene Trees to Species Trees
From MaRDI portal
Publication:4507371
DOI10.1137/S0097539798343362zbMath0968.68057MaRDI QIDQ4507371
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Complexity Insights of the Minimum Duplication Problem ⋮ Complexity insights of the minimum duplication problem ⋮ Gene tree correction for reconciliation and species tree inference: complexity and algorithms ⋮ Mathematical properties of the gene duplication cost ⋮ Correcting gene tree by removal and modification: tractability and approximability ⋮ Building species trees from larger parts of phylogenomic databases ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Beyond evolutionary trees ⋮ From Gene Trees to Species Trees through a Supertree Approach ⋮ Correcting gene trees by leaf insertions: complexity and approximation ⋮ Unnamed Item ⋮ Bootstrapping Algorithms for Gene Duplication and Speciation Events ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ Reconciling event-labeled gene trees with MUL-trees and species networks ⋮ Reconciling a gene tree to a species tree under the duplication cost model ⋮ A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree
Uses Software
