Cargando…
Near-medians that avoid the corners; a combinatorial probability approach
BACKGROUND: The breakpoint median for a set of k ≥ 3 random genomes tends to approach (any) one of these genomes ("corners") as genome length increases, although there are diminishing proportion of medians equidistant from all k ("medians in the middle"). Algorithms are likely to...
Autores principales: | Larlee, Caroline Anne, Zheng, Chunfang, Sankoff, David |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4239572/ https://www.ncbi.nlm.nih.gov/pubmed/25572274 http://dx.doi.org/10.1186/1471-2164-15-S6-S1 |
Ejemplares similares
-
Compromise or optimize? The breakpoint anti-median
por: Larlee, Caroline Anne, et al.
Publicado: (2016) -
Medians seek the corners, and other conjectures
por: Haghighi, Maryam, et al.
Publicado: (2012) -
Multichromosomal median and halving problems under different genomic distances
por: Tannier, Eric, et al.
Publicado: (2009) -
On the PATHGROUPS approach to rapid small phylogeny
por: Zheng, Chunfang, et al.
Publicado: (2011) -
Phase change for the accuracy of the median value in estimating divergence time
por: Jamshidpey, Arash, et al.
Publicado: (2013)