The inference of gene trees with species trees

GJ Szöllősi, E Tannier, V Daubin… - Systematic …, 2015 - academic.oup.com
This article reviews the various models that have been used to describe the relationships
between gene trees and species trees. Molecular phylogeny has focused mainly on …

Phylogenomics with paralogs

M Hellmuth, N Wieseke, M Lechner… - Proceedings of the …, 2015 - National Acad Sciences
Phylogenomics heavily relies on well-curated sequence data sets that comprise, for each
gene, exclusively 1: 1 orthologos. Paralogs are treated as a dangerous nuisance that has to …

iGTP: a software package for large-scale gene tree parsimony analysis

R Chaudhary, MS Bansal, A Wehe… - BMC …, 2010 - Springer
Background The ever-increasing wealth of genomic sequence information provides an
unprecedented opportunity for large-scale phylogenetic analysis. However, species …

Phylogenetic reconciliation

H Menet, V Daubin, E Tannier - PLOS Computational Biology, 2022 - journals.plos.org
In phylogenetics, reconciliation is an approach to connect the history of two or more
coevolving biological entities. The general idea of reconciliation is that a phylogenetic tree …

Inferring optimal species trees under gene duplication and loss

MS Bayzid, S Mirarab, T Warnow - Biocomputing 2013, 2013 - World Scientific
Species tree estimation from multiple markers is complicated by the fact that gene trees can
differ from each other (and from the true species tree) due to several biological processes …

Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence

R Chaudhary, JG Burleigh, O Eulenstein - BMC bioinformatics, 2012 - Springer
Background Gene tree-species tree reconciliation problems infer the patterns and processes
of gene evolution within a species tree. Gene tree parsimony approaches seek the …

Exact solutions for species tree inference from discordant gene trees

WC Chang, P Górecki, O Eulenstein - Journal of bioinformatics and …, 2013 - World Scientific
Phylogenetic analysis has to overcome the grant challenge of inferring accurate species
trees from evolutionary histories of gene families (gene trees) that are discordant with the …

[HTML][HTML] Complexity of modification problems for best match graphs

D Schaller, PF Stadler, M Hellmuth - Theoretical Computer Science, 2021 - Elsevier
Best match graphs (BMGs) are vertex-colored directed graphs that were introduced to model
the relationships of genes (vertices) from different species (colors) given an underlying …

DeCoDe: degenerate codon design for complete protein-coding DNA libraries

TC Shimko, PM Fordyce, Y Orenstein - Bioinformatics, 2020 - academic.oup.com
Motivation High-throughput protein screening is a critical technique for dissecting and
designing protein function. Libraries for these assays can be created through a number of …

Algorithms for genome-scale phylogenetics using gene tree parsimony

MS Bansal, O Eulenstein - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
The use of genomic data sets for phylogenetics is complicated by the fact that evolutionary
processes such as gene duplication and loss, or incomplete lineage sorting (deep …