Cargando…
Sorting genomes with rearrangements and segmental duplications through trajectory graphs
We study the problem of sorting genomes under an evolutionary model that includes genomic rearrangements and segmental duplications. We propose an iterative algorithm to improve any initial evolutionary trajectory between two genomes in terms of parsimony. Our algorithm is based on a new graphical m...
Autores principales: | Shao, Mingfu, Lin, Yu, Moret, Bernard |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3851842/ https://www.ncbi.nlm.nih.gov/pubmed/24564345 http://dx.doi.org/10.1186/1471-2105-14-S15-S9 |
Ejemplares similares
-
Comparing genomes with rearrangements and segmental duplications
por: Shao, Mingfu, et al.
Publicado: (2015) -
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion
por: Shao, Mingfu, et al.
Publicado: (2012) -
A maximum-likelihood approach for building cell-type trees by lifting
por: Nair, Nishanth Ulhas, et al.
Publicado: (2016) -
Estimating true evolutionary distances under rearrangements, duplications, and losses
por: Lin, Yu, et al.
Publicado: (2010) -
Genomic duplication problems for unrooted gene trees
por: Paszek, Jarosław, et al.
Publicado: (2016)