title: Near-medians that avoid the corners; a combinatorial probability approach.
abstract: 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 miss the latter, and this has consequences for the general case where input genomes share some or many gene adjacencies, where the tendency for the median to be closer to one input genome may be an artifact of the corner tendency.
  
  
  RESULTS
  We present a simple sampling procedure for constructing a "near median" that represents a compromise among k random genomes and that has only a slightly greater breakpoint distance to all of them than the median does. We generalize to the realistic case where genomes share varying proportions of gene adjacencies. We present a supplementary sampling scheme that brings the constructed genome even closer to median status.
  
  
  CONCLUSIONS
  Our approach is of particular use in the phylogenetic context where medians are repeatedly calculated at ancestral nodes, and where the corner effect prevents different parts of the phylogeny from communicating with each other.
authors.forename: Caroline
authors.initials: C
authors.lastname: Larlee
authors.forename: Chunfang
authors.initials: C
authors.lastname: Zheng
authors.forename: David
authors.initials: D
authors.lastname: Sankoff
mesh_terms: D000465:Algorithms; D016678:Genome; D023281:Genomics / Q000379:methods*; D008957:Models, Genetic