{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T20:08:59Z","timestamp":1675282139778},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"S14","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1186\/s12859-016-1261-9","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T10:05:54Z","timestamp":1478858754000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast ancestral gene order reconstruction of genomes with unequal gene content"],"prefix":"10.1186","volume":"17","author":[{"given":"Pedro","family":"Feij\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eloi","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"issue":"3","key":"1261_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D Sankoff","year":"1998","unstructured":"Sankoff D, Blanchette M. Multiple genome rearrangement and breakpoint phylogeny. J Comput Biol. 1998; 5(3):555\u201370.","journal-title":"J Comput Biol"},{"key":"1261_CR2","volume-title":"Pacific Symposium on Biocomputing","author":"BM Moret","year":"2001","unstructured":"Moret BM, Wyman S, Bader Da, Warnow T, Yan M. A new implementation and detailed study of breakpoint analysis. In: Pacific Symposium on Biocomputing. Singapore: World Scientific Publishing: 2001. p. 583\u201394."},{"issue":"1","key":"1261_CR3","first-page":"26","volume":"12","author":"G Bourque","year":"2002","unstructured":"Bourque G, Pevzner PA. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 2002; 12(1):26.","journal-title":"Genome Res"},{"issue":"16","key":"1261_CR4","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005; 21(16):3340\u20136.","journal-title":"Bioinformatics"},{"key":"1261_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/11851561_16","volume":"4175","author":"A Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. Lect Notes Comput Sci. 2006; 4175:163\u201373.","journal-title":"Lect Notes Comput Sci"},{"issue":"Suppl 1","key":"1261_CR6","first-page":"4","volume":"12 Suppl 1","author":"C Zheng","year":"2011","unstructured":"Zheng C, Sankoff D. On the PATHGROUPS approach to rapid small phylogeny. BMC bioinformatics. 2011; 12 Suppl 1(Suppl 1):4.","journal-title":"BMC bioinformatics"},{"key":"1261_CR7","volume-title":"Proceedings of the 11th International Workshop on Algorithms in Bioinformatics (WABI 2011)","author":"W Xu","year":"2011","unstructured":"Xu W, Moret B. GASTS: Parsimony scoring under rearrangements. In: Proceedings of the 11th International Workshop on Algorithms in Bioinformatics (WABI 2011). Berlin Heidelberg: Springer: 2011. p. 351\u201363."},{"issue":"5","key":"1261_CR8","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1101\/gr.082784.108","volume":"19","author":"MA Alekseyev","year":"2009","unstructured":"Alekseyev MA, Pevzner PA. Breakpoint graphs and ancestral genome reconstructions. Genome Res. 2009; 19(5):943\u201357.","journal-title":"Genome Res"},{"issue":"3","key":"1261_CR9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1089\/cmb.2015.0160","volume":"23","author":"P Avdeyev","year":"2016","unstructured":"Avdeyev P, Jiang S, Aganezov S, Hu F, Alekseyev MA. Reconstruction of ancestral genomes in presence of gene gain and loss. J Comput Biol. 2016; 23(3):150\u201364.","journal-title":"J Comput Biol"},{"key":"1261_CR10","doi-asserted-by":"crossref","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 Bioinforma. 2011; 8:1318\u20131329.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"1","key":"1261_CR11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TCBB.2012.168","volume":"10","author":"P Biller","year":"2013","unstructured":"Biller P, Feij\u00e3o P, Meidanis Ja. Rearrangement-based phylogeny using the single-cut-or-join operation. IEEE\/ACM Trans Comput Biol Bioinforma. 2013; 10(1):122\u201334.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"12","key":"1261_CR12","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1101\/gr.5383506","volume":"16","author":"J Ma","year":"2006","unstructured":"Ma J, Zhang L, Suh BBB, Raney BJBJ, Burhans RC, Kent WJJ, Blanchette M, Haussler D, Miller W. Reconstructing contiguous regions of an ancestral genome. Genome Res. 2006; 16(12):1557\u20131565.","journal-title":"Genome Res"},{"issue":"Suppl 19","key":"1261_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/1471-2105-13-S19-S4","volume":"13 Suppl 1","author":"Y Gagnon","year":"2012","unstructured":"Gagnon Y, Blanchette M, El-Mabrouk N. A flexible ancestral genome reconstruction method based on gapped adjacencies. BMC bioinformatics. 2012; 13 Suppl 1(Suppl 19):4.","journal-title":"BMC bioinformatics"},{"issue":"18","key":"1261_CR14","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1093\/bioinformatics\/bts457","volume":"28","author":"BR Jones","year":"2012","unstructured":"Jones BR, Rajaraman A, Tannier E, Chauve C. ANGES: reconstructing ANcestral GEnomeS maps. Bioinformatics (Oxford, England). 2012; 28(18):2388\u2013390.","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"c","key":"1261_CR15","first-page":"1","volume":"5963","author":"F Hu","year":"2014","unstructured":"Hu F, Zhou J, Zhou L, Tang J. Probabilistic Reconstruction of Ancestral Gene Orders with Insertions and Deletions. IEEE\/ACM Trans Comput Biol Bioinforma. 2014; 5963(c):1\u20131.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"1","key":"1261_CR16","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1186\/s12859-014-0354-6","volume":"15","author":"F Hu","year":"2014","unstructured":"Hu F, Lin Y, Tang J. MLGO: phylogeny reconstruction and ancestral inference from gene-order data. BMC bioinformatics. 2014; 15(1):354.","journal-title":"BMC bioinformatics"},{"issue":"Suppl 5","key":"1261_CR17","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1471-2164-16-S5-S6","volume":"16","author":"A Perrin","year":"2015","unstructured":"Perrin A, Varr\u00e9 J-s, Blanquart S, Ouangraoua A. ProCARs : Progressive Reconstruction of Ancestral Gene Orders. BMC Genomics. 2015; 16(Suppl 5):6.","journal-title":"BMC Genomics"},{"key":"1261_CR18","volume-title":"The SCJ Small Parsimony Problem for Weighted Gene Adjacencies","year":"2016","unstructured":"Luhmann N, Th\u00e9venin A, Ouangraoua A, Wittler R, Chauve C. In: Bourgeois A, Skums P, Wan X, Zelikovsky A, (eds).The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. Cham: Springer; 2016, pp. 200\u201310."},{"issue":"Suppl 14","key":"1261_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/1471-2105-16-S14-S3","volume":"16","author":"P Feij\u00e3o","year":"2015","unstructured":"Feij\u00e3o P. Reconstruction of ancestral gene orders using intermediate genomes. BMC Bioinformatics. 2015; 16(Suppl 14):3.","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"1261_CR20","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1748-7188-8-6","volume":"8","author":"PE Compeau","year":"2013","unstructured":"Compeau PE. DCJ-Indel sorting revisited. Algorithms Mole Biol: AMB. 2013; 8(1):6.","journal-title":"Algorithms Mole Biol: AMB"},{"issue":"9","key":"1261_CR21","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"MDV Braga","year":"2011","unstructured":"Braga MDV, Willing E, Stoye J. Double cut and join with insertions and deletions. J Comput Biol. 2011; 18(9):1167\u201384.","journal-title":"J Comput Biol"},{"key":"1261_CR22","doi-asserted-by":"crossref","unstructured":"Arndt W, Tang J. Emulating Insertion and Deletion Events in Genome Rearrangement Analysis. 2011 IEEE Int Conf Bioinforma Biomed. 2011::105\u2013108.","DOI":"10.1109\/BIBM.2011.55"},{"issue":"9","key":"1261_CR23","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MDV Braga","year":"2010","unstructured":"Braga MDV, Stoye J. The solution space of sorting by DCJ. J Comput Biol. 2010; 17(9):1145\u201365.","journal-title":"J Comput Biol"},{"key":"1261_CR24","volume-title":"Algorithms in Bioinformatics SE - 18. Lecture Notes in Computer Science","author":"K Swenson","year":"2015","unstructured":"Swenson K, Blanchette M. Models and Algorithms for Genome Rearrangement with Positional Constraints In: Pop M, Touzet H, editors. Algorithms in Bioinformatics SE - 18. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 2015. p. 243\u201356."},{"issue":"9","key":"1261_CR25","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1089\/cmb.2010.0106","volume":"17","author":"AW Xu","year":"2010","unstructured":"Xu AW. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions. J Comput Biol. 2010; 17(9):1195\u2013211.","journal-title":"J Comput Biol"},{"key":"1261_CR26","first-page":"138","volume":"14","author":"M Zhang","year":"2009","unstructured":"Zhang M, Arndt W, Tang J. An exact solver for the DCJ median problem. Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing. 2009; 14:138\u201349.","journal-title":"Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing"},{"issue":"Suppl 19","key":"1261_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/1471-2105-13-S19-S5","volume":"13 Suppl 1","author":"M Haghighi","year":"2012","unstructured":"Haghighi M, Sankoff D. Medians seek the corners, and other conjectures. BMC bioinformatics. 2012; 13 Suppl 1(Suppl 19):5.","journal-title":"BMC bioinformatics"},{"issue":"1","key":"1261_CR28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A Caprara","year":"2003","unstructured":"Caprara A. The reversal median problem. INFORMS J Comput. 2003; 15(1):93\u2013113.","journal-title":"INFORMS J Comput"},{"key":"1261_CR29","doi-asserted-by":"crossref","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 bioinformatics. 2009; 10:120.","journal-title":"BMC bioinformatics"},{"key":"1261_CR30","volume-title":"Algorithms and Computation SE - 15. Lecture Notes in Computer Science","author":"G Valiente","year":"2003","unstructured":"Valiente G. A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs In: Ibaraki T, Katoh N, Ono H, editors. Algorithms and Computation SE - 15. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 2003. p. 129\u201337."},{"issue":"1965","key":"1261_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds J. Maximum matching and a polyhedron with 0, l-vertices. J Res Nat Bur Standards B. 1965; 69(1965):125\u201330.","journal-title":"J Res Nat Bur Standards B"},{"issue":"19","key":"1261_CR32","first-page":"1","volume":"16","author":"C Chauve","year":"2015","unstructured":"Chauve C, Ponty Y, Zanetti JPP. Evolution of genes neighborhood within reconciled phylogenies: an ensemble approach. BMC Bioinformatics. 2015; 16(19):1\u20139.","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"1261_CR33","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-5193(77)90351-4","volume":"64","author":"MS Waterman","year":"1977","unstructured":"Waterman MS, Smith TF, Singh M, Beyer WA. Additive evolutionary trees. J Theor Biol. 1977; 64(2):199\u2013213.","journal-title":"J Theor Biol"},{"issue":"3760","key":"1261_CR34","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"WM Fitch","year":"1967","unstructured":"Fitch WM, Margoliash E. Construction of Phylogenetic Trees. Science. 1967; 155(3760):279\u201384.","journal-title":"Science"},{"issue":"1","key":"1261_CR35","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov V. Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math Program Comput. 2009; 1(1):43\u201367.","journal-title":"Math Program Comput"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1261-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T07:31:21Z","timestamp":1601191881000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1261-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":35,"journal-issue":{"issue":"S14","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1261"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1261-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]},"article-number":"413"}}