{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:31:11Z","timestamp":1743125471957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436807"},{"type":"electronic","value":"9783319436814"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43681-4_4","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T10:51:35Z","timestamp":1470394295000},"page":"40-51","source":"Crossref","is-referenced-by-count":0,"title":["Isometric Gene Tree Reconciliation Revisited"],"prefix":"10.1007","author":[{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Askar","family":"Gafurov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Sabo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2), 19 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"12","key":"4_CR2","doi-asserted-by":"crossref","first-page":"i283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28(12), i283\u2013i291 (2012)","journal-title":"Bioinformatics"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, Gaston H., Viola, Alfredo (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"issue":"2","key":"4_CR4","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. 48(2), 214\u2013230 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"4_CR5","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. Bioinform. 9(1), 26\u201339 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-642-16181-0_9","volume-title":"Comparative Genomics","author":"J-P Doyon","year":"2010","unstructured":"Doyon, J.-P., Scornavacca, C., Gorbunov, K.Y., Sz\u00f6ll\u0151si, G.J., Ranwez, V., Berry, V.: An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 93\u2013108. Springer, Heidelberg (2010)"},{"key":"4_CR7","unstructured":"Eulenstein, O.: A linear time algorithm for tree mapping. GMD-Forschungszentrum Informationstechnik (1997)"},{"key":"4_CR8","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Sunderland (2004)"},{"key":"4_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. MIT Press, Cambridge (2009)"},{"issue":"2","key":"4_CR10","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, G.W., 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. 28(2), 132\u2013163 (1979)","journal-title":"Syst. Biol."},{"issue":"1","key":"4_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, G.J., Eulenstein, O.: Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. BMC Bioinform. 12(1), 1 (2011)","journal-title":"BMC Bioinform."},{"issue":"2","key":"4_CR12","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, T.F.: Reconstruction of ancient molecular phylogeny. Mol. Phylogenet. Evol. 6(2), 189\u2013213 (1996)","journal-title":"Mol. Phylogenet. Evol."},{"issue":"2","key":"4_CR13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"38","key":"4_CR14","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, B.J., Suh, B.B., Miller, W., Haussler, D.: The infinite sites model of genome evolution. Proc. Nat. Acad. Sci. 105(38), 14254\u201314261 (2008a)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"8","key":"4_CR15","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, B.J., Suh, B.B., Zhang, L., Miller, W., Haussler, D.: DUPCAR: reconstructing contiguous ancestral regions with duplications. J. Comput. Biol. 15(8), 1007\u20131027 (2008b)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"4_CR16","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. 58(4), 411\u2013424 (2009)","journal-title":"Syst. Biol."},{"issue":"2","key":"4_CR17","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-Muchnik-Smith conjecture for comparing molecular phylogenies. J. Comput. Biol. 4(2), 177\u2013187 (1997)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"4_CR18","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1093\/bioinformatics\/17.9.821","volume":"17","author":"CM Zmasek","year":"2001","unstructured":"Zmasek, C.M., Eddy, S.R.: A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics 17(9), 821\u2013828 (2001)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43681-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:03:53Z","timestamp":1498320233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43681-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436807","9783319436814"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43681-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}