{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:46:30Z","timestamp":1779896790928,"version":"3.53.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN\/04622-2016"],"award-info":[{"award-number":["RGPIN\/04622-2016"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2016\/01511-7"],"award-info":[{"award-number":["2016\/01511-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13015-019-0150-y","type":"journal-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T12:02:37Z","timestamp":1564142557000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A cubic algorithm for the generalized rank median of three genomes"],"prefix":"10.1186","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6619-6013","authenticated-orcid":false,"given":"Leonid","family":"Chindelevitch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sean","family":"La","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joao","family":"Meidanis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"issue":"Suppl 6","key":"150_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1186\/s12859-018-2131-4","volume":"19","author":"L Chindelevitch","year":"2018","unstructured":"Chindelevitch L, Zanetti JPP, Meidanis J. On the rank-distance median of 3 permutations. BMC Bioinform. 2018;19(Suppl 6):142.","journal-title":"BMC Bioinform"},{"issue":"3","key":"150_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 Symb Comput. 1990;9(3):251.","journal-title":"J Symb Comput"},{"key":"150_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. 2009;10:120.","journal-title":"BMC Bioinform"},{"issue":"5","key":"150_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. 2011;8(5):1318\u201329.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"150_CR5","doi-asserted-by":"crossref","unstructured":"Caprara A. Formulations and hardness of multiple sorting by reversals. In: Proceeding 3rd annual international conference on research in computational molecular biology. New York: ACM Press; 1999. p. 84\u201394.","DOI":"10.1145\/299432.299461"},{"key":"150_CR6","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/s11538-016-0162-4","volume":"78","author":"JPP Zanetti","year":"2016","unstructured":"Zanetti JPP, Biller P, Meidanis J. Median approximations for genomes modeled as matrices. Bull Math Biol. 2016;78:786.","journal-title":"Bull Math Biol"},{"issue":"4","key":"150_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. 2012;10(4):819\u201331.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"150_CR8","unstructured":"Meidanis J, Biller P, Zanetti JPP. A matrix-based theory for genome rearrangements. Technical report, Institute of Computing, University of Campinas. 2017."},{"issue":"3","key":"150_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 Combin Theory A. 1978;25(3):226\u201341.","journal-title":"J Combin Theory A"},{"key":"150_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. 1972;49:172\u201386.","journal-title":"Arch Ration Mech Anal"},{"key":"150_CR11","first-page":"340","volume-title":"Linear algebra done right. Chapter 5. Undergraduate texts in mathematics","author":"S Axler","year":"2016","unstructured":"Axler S. Linear algebra done right. Chapter 5. Undergraduate texts in mathematics. 3rd ed. Berlin: Springer; 2016. p. 340.","edition":"3"},{"key":"150_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. Can J Math. 1965;17:449\u201367.","journal-title":"Can J Math"},{"key":"150_CR13","unstructured":"Hagberg AA, Schult DA, Swart PJ. Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux G, Vaught T, Millman J, editors. Proceedings of the 7th Python in Science Conference (SciPy2008). Pasadena; 2008. p. 11\u20135."},{"key":"150_CR14","unstructured":"van Rossum G. Python tutorial. Technical Report CS-R9526, Centrum voor Wiskunde en Informatica (CWI), Amsterdam. 1995."},{"issue":"1","key":"150_CR15","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. 1986;18(1):23\u201338.","journal-title":"ACM Comput Surv"},{"key":"150_CR16","unstructured":"R Core Team. R: a language and environment for statistical computing. Vienna: R Foundation for Statistical Computing. \n                    http:\/\/www.R-project.org\/\n                    \n                  . 2016."},{"key":"150_CR17","unstructured":"Lloyd N. Trefethen, David Bau, III. Numerical Linear Algebra, Lecture 5."},{"issue":"4","key":"150_CR18","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL. Compressed sensing. IEEE Trans Inform Theory. 2006;52(4):1289\u2013306.","journal-title":"IEEE Trans Inform Theory"},{"key":"150_CR19","first-page":"163","volume-title":"Lecture Notes in Computer Science","author":"Anne Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. In: Moret B, editors. Algorithms in bioinformatics proceedings of WABI; 2006."},{"key":"150_CR20","volume-title":"Maple 10 programming guide","author":"MB Monagan","year":"2005","unstructured":"Monagan MB, Geddes KO, Heal KM, Labahn G, Vorkoetter SM, et al. Maple 10 programming guide. Waterloo: Maplesoft; 2005."}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-019-0150-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T23:09:56Z","timestamp":1595632196000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-019-0150-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1186\/s13015-019-0150-y","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"assertion":[{"value":"9 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}