{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:12Z","timestamp":1763468112921},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Bioinform. Comput. Biol."],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:p> Comparative genomic studies are often conducted by reconciliation analyses comparing gene and species trees. One of the issues with reconciliation approaches is that an exponential number of optimal scenarios is possible. The resulting complexity is masked by the fact that a majority of reconciliation software pick up a random optimal solution that is returned to the end-user. However, the alternative solutions should not be ignored since they tell different stories that parsimony considers as viable as the output solution. In this paper, we describe a polynomial space and time algorithm to build a minimum reconciliation graph \u2014 a graph that summarizes the set of all most parsimonious reconciliations. Amongst numerous applications, it is shown how this graph allows counting the number of non-equivalent most parsimonious reconciliations. <\/jats:p>","DOI":"10.1142\/s0219720012500254","type":"journal-article","created":{"date-parts":[[2012,11,4]],"date-time":"2012-11-04T19:50:21Z","timestamp":1352058621000},"page":"1250025","source":"Crossref","is-referenced-by-count":38,"title":["REPRESENTING A SET OF RECONCILIATIONS IN A COMPACT WAY"],"prefix":"10.1142","volume":"11","author":[{"given":"CELINE","family":"SCORNAVACCA","sequence":"first","affiliation":[{"name":"ISEM, CNRS \u2013 Universit\u00e9 Montpellier II, Place Eug\u00e8ne Bataillon, 34095 Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WOJCIECH","family":"PAPROTNY","sequence":"additional","affiliation":[{"name":"Center for Bioinformatics (ZBIT), T\u00fcbingen University, Sand 14, 72076 T\u00fcbingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VINCENT","family":"BERRY","sequence":"additional","affiliation":[{"name":"IBC, LIRMM, CNRS \u2013 Universit\u00e9 Montpellier II, 95 rue de la Gal\u00e9ra, 34392 Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VINCENT","family":"RANWEZ","sequence":"additional","affiliation":[{"name":"Montpellier SupAgro, UMR AGAP, 2, Place P. Viala, 34060 Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,4,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2006-7-5-r43"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbr045"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1038\/nature09649"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798343362"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.320"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts225"},{"key":"rf8","first-page":"83","author":"G\u00f3recki P.","journal-title":"Logic and Program Semantics"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806251106"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.A010"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33122-0_10"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-S1-S60"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-5-16"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1202997109"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2007-8-7-r141"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000262"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-188"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq675"}],"container-title":["Journal of Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219720012500254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:33:35Z","timestamp":1565084015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219720012500254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":17,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2013,4,21]]},"published-print":{"date-parts":[[2013,4]]}},"alternative-id":["10.1142\/S0219720012500254"],"URL":"https:\/\/doi.org\/10.1142\/s0219720012500254","relation":{},"ISSN":["0219-7200","1757-6334"],"issn-type":[{"value":"0219-7200","type":"print"},{"value":"1757-6334","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}