Cargando…
A cubic algorithm for the generalized rank median of three genomes
BACKGROUND: The area of genome rearrangements has given rise to a number of interesting biological, mathematical and algorithmic problems. Among these, one of the most intractable ones has been that of finding the median of three genomes, a special case of the ancestral reconstruction problem. In th...
Autores principales: | Chindelevitch, Leonid, La, Sean, Meidanis, Joao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6867026/ https://www.ncbi.nlm.nih.gov/pubmed/31832081 http://dx.doi.org/10.1186/s13015-019-0150-y |
Ejemplares similares
-
On the rank-distance median of 3 permutations
por: Chindelevitch, Leonid, et al.
Publicado: (2018) -
Generalizations of the genomic rank distance to indels
por: Pereira Zanetti, João Paulo, et al.
Publicado: (2023) -
Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios
por: Lyubetsky, Vassily A, et al.
Publicado: (2012) -
Three-fold utilization of supplementary information for mean estimation under median ranked set sampling scheme
por: Shahzad, Usman, et al.
Publicado: (2022) -
A sub-cubic time algorithm for computing the quartet distance between two general trees
por: Nielsen, Jesper, et al.
Publicado: (2011)