A fast and exact algorithm for the median of three problem: a graph decomposition approach.
Abstract In a previous article, we have shown that adequate subgraphs can be used to decompose multiple breakpoint graphs, achieving a dramatic speedup in solving the median problem. In this article, focusing on the median of three problem, we prove more important properties about adequate subgraphs with rank 3 and discuss the algorithms inventorying simple adequate subgraphs. After finding simple adequate subgraphs of small sizes, we incorporate them into ASMedian, an algorithm to solve the median of three problem. Results on simulated data show dramatic speedup so that many instances can be solved very quickly, even ones containing hundreds or thousands of genes.
Xu
Andrew Wei
AW
Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada. wei.xu@epfl.ch
D000465:Algorithms; D002875:Chromosomes / Q000235:genetics; D019295:Computational Biology / Q000379:methods*; D015321:Gene Rearrangement; D016678:Genome; D008957:Models, Genetic; D010802:Phylogeny