{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:06:39Z","timestamp":1725807999551},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124179"},{"type":"electronic","value":"9783319124186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12418-6_7","type":"book-chapter","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T11:39:37Z","timestamp":1414064377000},"page":"49-56","source":"Crossref","is-referenced-by-count":2,"title":["Evolution of Genes Neighborhood within Reconciled Phylogenies: An Ensemble Approach"],"prefix":"10.1007","author":[{"given":"Cedric","family":"Chauve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Ponty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o Paulo Pereira","family":"Zanetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"7_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"M.S. 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\u00a028(12), 283\u2013291 (2012)","journal-title":"Bioinformatics"},{"issue":"10","key":"7_CR2","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1089\/cmb.2013.0073","volume":"20","author":"M.S. Bansal","year":"2013","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Reconciliation revisited: Handling multiple optima when reconciling with duplication, transfer, and loss. Journal of Computational Biology\u00a020(10), 738\u2013754 (2013)","journal-title":"Journal of Computational Biology"},{"issue":"18","key":"7_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1093\/bioinformatics\/bts374","volume":"28","author":"S. B\u00e9rard","year":"2012","unstructured":"B\u00e9rard, S., Gallien, C., Boussau, B., Sz\u00f6llosi, G.J., Daubin, V., Tannier, E.: Evolution of gene neighborhoods within reconciled phylogenies. Bioinformatics\u00a028(18), 382\u2013388 (2012)","journal-title":"Bioinformatics"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Clote, P., Lou, F., Lorenz, W.A.: Maximum expected accuracy structural neighbors of an RNA secondary structure. BMC Bioinformatics, 13(S-5), S6 (2012)","DOI":"10.1186\/1471-2105-13-S5-S6"},{"key":"7_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-87989-3_6","volume-title":"Comparative Genomics","author":"M. Cs\u0171r\u00f6s","year":"2008","unstructured":"Cs\u0171r\u00f6s, M.: Ancestral reconstruction by asymmetric wagner parsimony over continuous characters and squared parsimony over distributions. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 72\u201386. Springer, Heidelberg (2008)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cs\u00fcr\u00f6s, M.: How to infer ancestral genome features by parsimony: Dynamic programming over an evolutionary tree. In: Models and Algorithms for Genome Evolution, pp. 29\u201345. Springer (2013)","DOI":"10.1007\/978-1-4471-5298-9_3"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","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. Biology Bioinform.\u00a09(1), 26\u201339 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06398, pp. 93\u2013108. Springer, Heidelberg (2010)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Liberles, D.A. (ed.): Ancestral Sequence Reconstruction. Oxford University Press (2007)","DOI":"10.1093\/acprof:oso\/9780199299188.001.0001"},{"issue":"12","key":"7_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1093\/bioinformatics\/btu289","volume":"30","author":"R. Libeskind-Hadas","year":"2014","unstructured":"Libeskind-Hadas, R., Wu, Y.-C., Bansal, M.S., Kellis, M.: Pareto-optimal phylogenetic tree reconciliation. Bioinformatics\u00a030(12), 87\u201395 (2014)","journal-title":"Bioinformatics"},{"issue":"46","key":"7_CR11","doi-asserted-by":"publisher","first-page":"16138","DOI":"10.1073\/pnas.0406011101","volume":"101","author":"L. Pachter","year":"2004","unstructured":"Pachter, L., Sturmfels, B.: Parametric inference for biological sequence analysis. PNAS\u00a0101(46), 16138\u201316143 (2004)","journal-title":"PNAS"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Patterson, M., Sz\u00f6llosi, G.J., Daubin, V., Tannier, E.: Lateral gene transfer, rearrangement, reconciliation. BMC Bioinformatics, 14(S-15), S4 (2013)","DOI":"10.1186\/1471-2105-14-S15-S4"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-23038-7_22","volume-title":"Algorithms in Bioinformatics","author":"Y. Ponty","year":"2011","unstructured":"Ponty, Y., Saule, C.: A combinatorial framework for designing (Pseudoknotted) RNA algorithms. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol.\u00a06833, pp. 250\u2013269. Springer, Heidelberg (2011)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Scornavacca, C., Paprotny, W., Berry, V., Ranwez, V.: Representing a set of reconciliations in a compact way. J. Bioinformatics and Computational Biology 11(2) (2013)","DOI":"10.1142\/S0219720012500254"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12418-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T02:56:39Z","timestamp":1559012199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12418-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124179","9783319124186"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12418-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}