Cargando…
An ILP solution for the gene duplication problem
BACKGROUND: The gene duplication (GD) problem seeks a species tree that implies the fewest gene duplication events across a given collection of gene trees. Solving this problem makes it possible to use large gene families with complex histories of duplication and loss to infer phylogenetic trees. Ho...
Autores principales: | Chang, Wen-Chieh, Burleigh, Gordon J, Fernández-Baca, David F, Eulenstein, Oliver |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3044268/ https://www.ncbi.nlm.nih.gov/pubmed/21342543 http://dx.doi.org/10.1186/1471-2105-12-S1-S14 |
Ejemplares similares
-
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence
por: Chaudhary, Ruchi, et al.
Publicado: (2012) -
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses
por: Górecki, Pawel, et al.
Publicado: (2011) -
The multiple gene duplication problem revisited
por: Bansal, Mukul S., et al.
Publicado: (2008) -
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
por: Bansal, Mukul S, et al.
Publicado: (2010) -
Robinson-Foulds Supertrees
por: Bansal, Mukul S, et al.
Publicado: (2010)