Sciweavers

14 search results - page 1 / 3
» An Approximation Algorithm for Computing a Parsimonious Firs...
Sort
View
RECOMB
2010
Springer
13 years 3 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
RECOMB
2010
Springer
13 years 2 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
IANDC
2011
148views more  IANDC 2011»
12 years 11 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
CSB
2003
IEEE
106views Bioinformatics» more  CSB 2003»
13 years 10 months ago
Reconstruction of Ancestral Gene Order after Segmental Duplication and Gene Loss
As gene order evolves through a variety of chromosomal rearrangements, conserved segments provide important insight into evolutionary relationships and functional roles of genes. ...
Jun Huan, Jan Prins, Wei Wang 0010, Todd J. Vision
BMCBI
2010
135views more  BMCBI 2010»
13 years 4 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...