{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:55:56Z","timestamp":1717894556771},"reference-count":26,"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":[[2015,12]]},"DOI":"10.1186\/1471-2105-16-s14-s3","type":"journal-article","created":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T04:04:47Z","timestamp":1443845087000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Reconstruction of ancestral gene orders using intermediate genomes"],"prefix":"10.1186","volume":"16","author":[{"given":"Pedro","family":"Feij\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,2]]},"reference":[{"issue":"3","key":"7175_CR1","doi-asserted-by":"publisher","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. Journal of Computational Biology. 1998, 5 (3): 555-570. 10.1089\/cmb.1998.5.555.","journal-title":"Journal of Computational Biology"},{"issue":"16","key":"7175_CR2","doi-asserted-by":"publisher","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-6. 10.1093\/bioinformatics\/bti535.","journal-title":"Bioinformatics"},{"key":"7175_CR3","doi-asserted-by":"publisher","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. Lecture Notes in Computer Science. 2006, 4175: 163-173. 10.1007\/11851561_16.","journal-title":"Lecture Notes in Computer Science"},{"issue":"5","key":"7175_CR4","doi-asserted-by":"publisher","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 Research. 2009, 19 (5): 943-57. 10.1101\/gr.082784.108.","journal-title":"Genome Research"},{"issue":"Suppl 1","key":"7175_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/1471-2105-12-S1-S4","volume":"12","author":"C Zheng","year":"2011","unstructured":"Zheng C, Sankoff D: On the PATHGROUPS approach to rapid small phylogeny. BMC bioinformatics. 2011, 12 (Suppl 1): 4-10.1186\/1471-2105-12-S1-S4.","journal-title":"BMC bioinformatics"},{"key":"7175_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-23038-7_29","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. Proceedings of the 11th International Workshop on Algorithms in Bioinformatics (WABI 2011). 2011, 351-363."},{"issue":"1","key":"7175_CR7","doi-asserted-by":"publisher","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 Transactions on Computational Biology and Bioinformatics. 2013, 10 (1): 122-134.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"7175_CR8","doi-asserted-by":"publisher","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 Transactions on Computational Biology and Bioinformatics. 2011, 8: 1318-1329.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"12","key":"7175_CR9","doi-asserted-by":"publisher","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 Research. 2006, 16 (12): 1557-1565. 10.1101\/gr.5383506.","journal-title":"Genome Research"},{"issue":"Suppl 1(Suppl 1","key":"7175_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/1471-2105-13-S19-S4","volume":"13","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":"7175_CR11","doi-asserted-by":"publisher","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-2390. 10.1093\/bioinformatics\/bts457.","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"10","key":"7175_CR12","doi-asserted-by":"publisher","first-page":"108796","DOI":"10.1371\/journal.pone.0108796","volume":"9","author":"N Yang","year":"2014","unstructured":"Yang N, Hu F, Zhou L, Tang J: Reconstruction of ancestral gene orders using probabilistic and gene encoding approaches. PloS one. 2014, 9 (10): 108796-10.1371\/journal.pone.0108796.","journal-title":"PloS one"},{"issue":"1","key":"7175_CR13","doi-asserted-by":"publisher","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":"7175_CR14","doi-asserted-by":"publisher","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-10.1186\/1471-2164-16-S5-S6.","journal-title":"BMC Genomics"},{"issue":"9","key":"7175_CR15","doi-asserted-by":"publisher","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. Journal of Computational Biology. 2010, 17 (9): 1145-65. 10.1089\/cmb.2010.0109.","journal-title":"Journal of Computational Biology"},{"key":"7175_CR16","doi-asserted-by":"publisher","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-10.1186\/1471-2105-10-120.","journal-title":"BMC bioinformatics"},{"issue":"9","key":"7175_CR17","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1089\/cmb.2010.0126","volume":"17","author":"A Ouangraoua","year":"2010","unstructured":"Ouangraoua A, Bergeron A: Combinatorial structure of genome rearrangements scenarios. Journal of computational biology : a journal of computational molecular cell biology. 2010, 17 (9): 1129-1144. 10.1089\/cmb.2010.0126. doi:10.1089\/cmb.2010.0126","journal-title":"Journal of computational biology : a journal of computational molecular cell biology"},{"key":"7175_CR18","unstructured":"The On-Line Encyclopedia of Integer Sequences. 2010, Accessed: 2015-06-14"},{"issue":"9","key":"7175_CR19","doi-asserted-by":"publisher","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. Journal of Computational Biology. 2010, 17 (9): 1195-211. 10.1089\/cmb.2010.0106.","journal-title":"Journal of Computational Biology"},{"key":"7175_CR20","first-page":"138","volume-title":"Pacific Symposium on Biocomputing","author":"M Zhang","year":"2009","unstructured":"Zhang M, Arndt W, Tang J: An exact solver for the DCJ median problem. Pacific Symposium on Biocomputing. 2009, 138-49."},{"issue":"Suppl 1(Suppl 1","key":"7175_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/1471-2105-13-S19-S5","volume":"13","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":"Suppl 1","key":"7175_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/1471-2105-10-S1-S7","volume":"10","author":"KM Swenson","year":"2009","unstructured":"Swenson KM, Moret BME: Inversion-based genomic signatures. BMC bioinformatics. 2009, 10 (Suppl 1): 7-10.1186\/1471-2105-10-S1-S7. doi:10.1186\/1471-2105-10-S1-S7","journal-title":"BMC bioinformatics"},{"issue":"Suppl 1","key":"7175_CR23","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/1471-2105-10-S1-S6","volume":"10","author":"KM Swenson","year":"2009","unstructured":"Swenson KM, To Y, Tang J, Moret BME: Maximum independent sets of commuting and noninterfering inversions. BMC bioinformatics. 2009, 10 (Suppl 1): 6-10.1186\/1471-2105-10-S1-S6. doi:10.1186\/1471-2105-10-S1-S6","journal-title":"BMC bioinformatics"},{"key":"7175_CR24","first-page":"285","volume-title":"Pacific Symposium on Biocomputing","author":"Y Lin","year":"2013","unstructured":"Lin Y, Hu F, Tang J, Moret B: Maximum Likelihood Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Tree of 68 Eukaryotes. Pacific Symposium on Biocomputing. 2013, 285-296."},{"issue":"9","key":"7175_CR25","doi-asserted-by":"publisher","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. Journal of Computational Biology. 2011, 18 (9): 1167-84. 10.1089\/cmb.2011.0118. doi:10.1089\/cmb.2011.0118","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"7175_CR26","doi-asserted-by":"publisher","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 for molecular biology : AMB. 2013, 8 (1): 6-10.1186\/1748-7188-8-6. doi:10.1186\/1748-7188-8-6","journal-title":"Algorithms for molecular biology : AMB"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-16-S14-S3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T04:53:25Z","timestamp":1599627205000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-16-S14-S3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,2]]},"references-count":26,"journal-issue":{"issue":"S14","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["7175"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-16-s14-s3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,2]]},"assertion":[{"value":"2 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S3"}}