Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.

Bioinformatics (Oxford, England) - 1 Apr 2017

Jacox Edwin, Weller Mathias, Tannier Eric, Scornavacca Celine

Abstract excerpt

Summary: Gene trees reconstructed from sequence alignments contain poorly supported branches when the phylogenetic signal in the sequences is insufficient to determine them all. When a species tree is available, the signal of gains and losses of genes can be used to correctly resolve the unsupported parts of the gene history. However finding a most parsimonious binary resolution of a non-binary tree obtained by...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computer Simulation
Share to Cyanobacteria

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Databases, Genetic

Share to Extinction, Biological

Share to Gene Duplication

Share to Proteobacteria

Source

Identifiers

PMID: 28073758
DOI: 10.1093/bioinformatics/btw778

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 3 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.PMID 28073758Read ↗

Reconciliation with non-binary species trees.Semantic proximity Read ↗

Reconciliation of gene and species trees.Semantic proximity Read ↗

Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion.Semantic proximity Read ↗

URec: a system for unrooted reconciliation.Semantic proximity Read ↗

Computing recombination networks from binary sequences.Semantic proximity Read ↗

Inferring phylogenetic trees from the knowledge of rare evolutionary events.Semantic proximity Read ↗

The inference of gene trees with species trees.Semantic proximity Read ↗

Towards a Unified Exact Solution of Rearrangement Small Parsimony for Natural GenomesSemantic proximity Read ↗

Fast and accurate phylogenetic reconstruction from high-resolution whole-genome data and a novel robustness estimator.Semantic proximity Read ↗

Reconciliation feasibility in the presence of gene duplication, loss, and coalescence with multiple individuals per species.Semantic proximity Read ↗

A stochastic local search algorithm for distance-based phylogeny reconstruction.Semantic proximity Read ↗

Automatic genome-wide reconstruction of phylogenetic gene trees.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.