{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T23:40:08Z","timestamp":1751845208383,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008338"},{"type":"electronic","value":"9783030008345"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00834-5_1","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T03:53:16Z","timestamp":1536292396000},"page":"3-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Cubic Algorithm for the Generalized Rank Median of Three Genomes"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Chindelevitch","sequence":"first","affiliation":[]},{"given":"Joao","family":"Meidanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Chindelevitch, L., Zanetti, J.P.P., Meidanis, J.: On the Rank-Distance Median of 3 permutations. BMC Bioinform. 19(Suppl. 6), 142 (2018). A preliminary version appeared. In: Meidanis, J., Nakhleh, L. (eds.) Proceedings of 15th RECOMB Comparative Genomics Satellite Workshop. LNCS. vol. 10562, pp. 256\u2013276. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-67979-2_14","DOI":"10.1007\/978-3-319-67979-2_14"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3), 251 (1990)","journal-title":"J. Symbolic Comput."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P Feijao","year":"2011","unstructured":"Feijao, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Formulations and hardness of multiple sorting by reversals. In: Proceedings of 3rd Annual International Conference on Research in Computational Molecular Biology, pp. 84\u201394. ACM Press, New York (1999)","DOI":"10.1145\/299432.299461"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/s11538-016-0162-4","volume":"78","author":"JPP Zanetti","year":"2016","unstructured":"Zanetti, J.P.P., Biller, P., Meidanis, J.: Median approximations for genomes modeled as matrices. Bull. Math. Biol. 78, 786 (2016)","journal-title":"Bull. Math. Biol."},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/TCBB.2012.161","volume":"10","author":"P Feijao","year":"2012","unstructured":"Feijao, P., Meidanis, J.: Extending the algebraic formalism for genome rearrangements to include linear chromosomes. IEEE\/ACM Trans. Comput. Biol. Bioinform. 10(4), 819\u2013831 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"1_CR8","unstructured":"Meidanis, J., Biller, P., Zanetti, J.P.P.: A Matrix-Based Theory for Genome Rearrangements. Technical Report, Institute of Computing, University of Campinas (2017)"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory A. 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory A."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BF00255664","volume":"49","author":"F Horn","year":"1972","unstructured":"Horn, F.: Necessary and sufficient conditions for complex balancing in chemical kinetics. Arch. Ration. Mech. Anal. 49, 172\u2013186 (1972)","journal-title":"Arch. Ration. Mech. Anal."},{"key":"1_CR11","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11080-6","volume-title":"Linear Algebra Done Right","author":"S Axler","year":"2015","unstructured":"Axler, S.: Linear Algebra Done Right. UTM. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-11080-6"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv. 18(1), 23\u201338 (1986)","journal-title":"ACM Comput. Surv."},{"key":"1_CR14","unstructured":"van Rossum, G. Python tutorial. Technical Report CS-R9526, Centrum voor Wiskunde en Informatica (CWI), Amsterdam (1995)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference (SciPy2008), Pasadena, CA, USA, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Moret, B. (ed.) Algorithms in Bioinformatics Proceedings of WABI (2006)","DOI":"10.1007\/11851561_16"},{"key":"1_CR17","unstructured":"R Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2016). www.R-project.org\/"},{"key":"1_CR18","volume-title":"Maple 10 Programming Guide","author":"MB Monagan","year":"2005","unstructured":"Monagan, M.B., Geddes, K.O., Heal, K.M., Labahn, G., Vorkoetter, S.M.: Maple 10 Programming Guide. Maplesoft, Waterloo (2005)"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00834-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T23:19:42Z","timestamp":1751843982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00834-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008338","9783030008345"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00834-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}