Abstract
The Genome Median Problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. Recently, Feijão and Meidanis extended the algebraic theory for genome rearrangement to allow for linear chromosomes, thus yielding a new rearrangement model (the algebraic model), very close to the celebrated DCJ model. In this paper, we study the genome median problem under the algebraic model, whose complexity is currently open, proposing a more general form of the problem, the matrix median problem. It is known that, for any metric distance, at least one of the corners is a \(\frac{4}{3}\)-approximation of the median. Our results allow us to compute up to three additional matrix median candidates, all of them with approximation ratios at least as good as the best corner, when the input matrices come from genomes. From the application point of view, it is usually more interesting to locate medians farther from the corners. We also show a fourth median candidate that gives better results in cases we tried. However, we do not have proven bounds for this fourth candidate yet.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research 12(1), 26–36 (2002)
Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. Journal of Combinatorial Theory, Series A 25(3), 226–241 (1978)
Feijao, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, 1318–1329 (2011)
Feijao, P., Meidanis, J.: Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. In: de Souto, M.C.P., Kann, M.G. (eds.) BSB 2012. LNCS (LNBI), vol. 7409, pp. 13–24. Springer, Heidelberg (2012)
Haghighi, M., Sankoff, D.: Medians seek the corners, and other conjectures. BMC Bioinformatics 13(suppl. 19), S5 (2012)
Meidanis, J., Dias, Z.: An alternative algebraic formalism for genome rearrangements. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213–223. Kluwer Academic Publishers (2000)
Moret, B.M., Wang, L.S., Warnow, T., Wyman, S.K.: New approaches for reconstructing phylogenies from gene order data. Bioinformatics 17(suppl. 1), S165–S173 (2001)
Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology 5(3), 555–570 (1998)
Sankoff, D., Sundaram, G., Kececioglu, J.: Steiner points in the space of genome rearrangements. International Journal of Foundations of Computer Science 7(01), 1–9 (1996)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10, 120 (2009)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange.. Bioinformatics 21(16), 3340–3346 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zanetti, J.P.P., Biller, P., Meidanis, J. (2013). On the Matrix Median Problem. In: Darling, A., Stoye, J. (eds) Algorithms in Bioinformatics. WABI 2013. Lecture Notes in Computer Science(), vol 8126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40453-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-40453-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40452-8
Online ISBN: 978-3-642-40453-5
eBook Packages: Computer ScienceComputer Science (R0)