{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:30Z","timestamp":1740144510201,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-14-0253"],"award-info":[{"award-number":["APVV-14-0253"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0684\/16","1\/0719\/14","2\/0165\/16"],"award-info":[{"award-number":["1\/0684\/16","1\/0719\/14","2\/0165\/16"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0108-x","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T10:04:11Z","timestamp":1497348251000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Isometric gene tree reconciliation revisited"],"prefix":"10.1186","volume":"12","author":[{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"first","affiliation":[]},{"given":"Askar","family":"Gafurov","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Sabo","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,13]]},"reference":[{"issue":"38","key":"108_CR1","doi-asserted-by":"crossref","first-page":"14254","DOI":"10.1073\/pnas.0805217105","volume":"105","author":"J Ma","year":"2008","unstructured":"Ma J, Ratan A, Raney BJ, Suh BB, Miller W, Haussler D. The infinite sites model of genome evolution. Proc Natl Acad Sci. 2008;105(38):14254\u201361.","journal-title":"Proc Natl Acad Sci"},{"issue":"8","key":"108_CR2","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1089\/cmb.2008.0069","volume":"15","author":"J Ma","year":"2008","unstructured":"Ma J, Ratan A, Raney BJ, Suh BB, Zhang L, Miller W, Haussler D. DUPCAR: reconstructing contiguous ancestral regions with duplications. J Comput Biol. 2008;15(8):1007\u201327.","journal-title":"J Comput Biol"},{"key":"108_CR3","volume-title":"Inferring phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein J. Inferring phylogenies. Sunderland: Sinauer Associates; 2004."},{"issue":"2","key":"108_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1093\/sysbio\/28.2.132","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera A, Matsuda G. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Biol. 1979;28(2):132\u201363.","journal-title":"Syst Biol"},{"issue":"2","key":"108_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/mpev.1996.0071","volume":"6","author":"R Guigo","year":"1996","unstructured":"Guigo R, Muchnik I, Smith TF. Reconstruction of ancient molecular phylogeny. Mol Phylogenet Evol. 1996;6(2):189\u2013213.","journal-title":"Mol Phylogenet Evol"},{"issue":"2","key":"108_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","volume":"4","author":"L Zhang","year":"1997","unstructured":"Zhang L. On a Mirkin\u2013Muchnik\u2013Smith conjecture for comparing molecular phylogenies. J Comput Biol. 1997;4(2):177\u201387.","journal-title":"J Comput Biol"},{"key":"108_CR7","unstructured":"Eulenstein O. A linear time algorithm for tree mapping. GMD-Forschungszentrum Informationstechnik (1997)."},{"issue":"9","key":"108_CR8","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1093\/bioinformatics\/17.9.821","volume":"17","author":"CM Zmasek","year":"2001","unstructured":"Zmasek CM, Eddy SR. A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics. 2001;17(9):821\u20138.","journal-title":"Bioinformatics"},{"key":"108_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of genome rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin G, Labarre A, Rusu I, Tannier E, Vialette S. Combinatorics of genome rearrangements. Cambridge: MIT Press; 2009."},{"issue":"4","key":"108_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1093\/sysbio\/syp046","volume":"58","author":"B Sennblad","year":"2009","unstructured":"Sennblad B, Lagergren J. Probabilistic orthology analysis. Syst Biol. 2009;58(4):411\u201324.","journal-title":"Syst Biol"},{"issue":"1","key":"108_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-12-1","volume":"12","author":"P G\u00f3recki","year":"2011","unstructured":"G\u00f3recki P, Burleigh GJ, Eulenstein O. Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. BMC Bioinform. 2011;12(1):1.","journal-title":"BMC Bioinform"},{"issue":"1","key":"108_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TCBB.2011.64","volume":"9","author":"J-P Doyon","year":"2012","unstructured":"Doyon J-P, Hamel S, Chauve C. An efficient method for exploring the space of gene tree\/species tree reconciliations in a probabilistic framework. IEEE\/ACM Trans Comput Biol Bioinfor. 2012;9(1):26\u201339.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinfor"},{"key":"108_CR13","doi-asserted-by":"crossref","unstructured":"Doyon JP, Scornavacca C, Gorbunov KY, Sz\u00f6ll\u0151si GJ, Ranwez V, Berry V. An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. In: Comparative genomics (RECOMB-CG 2012) vol. 6398, pp. 93\u2013108. Berlin: Springer; 2010.","DOI":"10.1007\/978-3-642-16181-0_9"},{"issue":"12","key":"108_CR14","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012;28(12):283\u201391.","journal-title":"Bioinformatics"},{"issue":"2","key":"108_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel D, Tarjan RE. Fast algorithms for finding nearest common ancestors. SIAM J Comput. 1984;13(2):338\u201355.","journal-title":"SIAM J Comput"},{"key":"108_CR16","doi-asserted-by":"crossref","unstructured":"Bender MA, Farach-Colton M. The LCA problem revisited. In: LATIN 2000: theoretical informatics, vol. 1776, pp. 88\u201394. Berlin: Springer; 2000.","DOI":"10.1007\/10719839_9"},{"issue":"2","key":"108_CR17","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O Berkman","year":"1994","unstructured":"Berkman O, Vishkin U. Finding level-ancestors in trees. J Comput Syst Sci. 1994;48(2):214\u201330.","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"108_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir A, Landau GM, Lewenstein M, Sokol D. Dynamic text and static pattern matching. ACM Trans Algorithm. 2007;3(2):19.","journal-title":"ACM Trans Algorithm"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0108-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T20:51:47Z","timestamp":1569444707000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0108-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["108"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0108-x","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2017,6,13]]},"article-number":"17"}}