Compromise or optimize? The breakpoint anti-median

BMC Bioinformatics

Research

David Sankoff¹  Caroline Anne Larlee¹  Alex Brandts¹ 

[1] Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, K1N 6N5, Ottawa, Canada;

关键词: Median problem;    Gene order;    Breakpoint distance;    Gene adjacency;   

DOI  :  10.1186/s12859-016-1340-y

来源: Springer

【 摘 要 】

BackgroundThe median of k≥3 genomes was originally defined to find a compromise genome indicative of a common ancestor. However, in gene order comparisons, the usual definitions based on minimizing the sum of distances to the input genomes lead to degenerate medians reflecting only one of the input genomes. “Near-medians”, consisting of equal samples of gene adjacencies from all the input genomes, were designed to restore the idea of compromise to the median problem.ResultWe explore adjacency sampling constructions in full generality in the case k=3, with given overlapping sets of adjacencies in the three genomes, where all adjacencies in two-way or three-way overlaps are included in the sample. We require the construction to be maximal, in the sense that no additional proportion of adjacencies from any of the genomes may be added without violating the local linearity of the genome. We discover that in incorporating as many adjacencies as possible, evenly from all the input genomes, we are actually maximizing, rather than minimizing, the sum of distances over all other maximal sampling schemes.ConclusionsWe propose to explore compromise instead of parsimony as the organizing principle for the small phylogeny problem.

【 授权许可】

CC BY   
© The Author(s) 2016

【 图 表 】

12864_2016_2682_Article_IEq28.gif

12888_2017_1557_Article_IEq4.gif

12864_2017_4348_Article_IEq5.gif

12888_2017_1557_Article_IEq3.gif