{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:31:08Z","timestamp":1675276268139},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"S19","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1186\/1471-2105-13-s19-s1","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T09:44:41Z","timestamp":1548150281000},"source":"Crossref","is-referenced-by-count":4,"title":["On pairwise distances and median score of three genomes under DCJ"],"prefix":"10.1186","volume":"13","author":[{"suffix":"Jr","given":"Sergey","family":"Aganezov","sequence":"first","affiliation":[]},{"given":"Max A","family":"Alekseyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,19]]},"reference":[{"issue":"16","key":"5510_CR1","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-3346. 10.1093\/bioinformatics\/bti535.","journal-title":"Bioinformatics"},{"key":"5510_CR2","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":"2-3","key":"5510_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev MA, Pevzner PA: Multi-Break Rearrangements and Chromosomal Evolution. Theoretical Computer Science. 2008, 395 (2-3): 193-202. 10.1016\/j.tcs.2008.01.013.","journal-title":"Theoretical Computer Science"},{"key":"5510_CR4","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"},{"key":"5510_CR5","doi-asserted-by":"publisher","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 Journal on Computing. 2003, 15: 93-113. 10.1287\/ijoc.15.1.93.15155.","journal-title":"INFORMS Journal on Computing"},{"key":"5510_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87361-7_3","volume":"5251","author":"AW Xu","year":"2008","unstructured":"Xu AW, Sankoff D: Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem. Lecture Notes in Computer Science. 2008, 5251: 25-37. 10.1007\/978-3-540-87361-7_3.","journal-title":"Lecture Notes in Computer Science"},{"key":"5510_CR7","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1089\/cmb.2009.0087","volume":"16","author":"AW Xu","year":"2009","unstructured":"Xu AW: A Fast and Exact Algorithm for the Median of three Problem: a Graph Decomposition Approach. Journal of Computational Biology. 2009, 16: 1369-1381. 10.1089\/cmb.2009.0087.","journal-title":"Journal of Computational Biology"},{"key":"5510_CR8","first-page":"1","volume-title":"Doctoral Symposium on Engineering: Stochastic Local Search Algorithms (SLSDS). IRIDIA Technical Report Series","author":"R Lenne","year":"2007","unstructured":"Lenne R, Solnon C, Tannier E, Birattari M: Effective Stochastic Local Search Algorithms for the Genomic Median Problem. Doctoral Symposium on Engineering: Stochastic Local Search Algorithms (SLSDS). IRIDIA Technical Report Series. 2007, 1-5."},{"issue":"Suppl 1","key":"5510_CR9","doi-asserted-by":"publisher","first-page":"S30","DOI":"10.1186\/1471-2105-11-S1-S30","volume":"11","author":"V Rajan","year":"2010","unstructured":"Rajan V, Xu A, Lin Y, Swenson K, Moret B: Heuristics for the inversion median problem. BMC Bioinformatics. 2010, 11 (Suppl 1): S30-10.1186\/1471-2105-11-S1-S30.","journal-title":"BMC Bioinformatics"},{"key":"5510_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/1389095.1389151","volume-title":"Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO)","author":"A Goeffon","year":"2008","unstructured":"Goeffon A, Nikolski M, Sherman DJ: An efficient probabilistic population-based descent for the median genome problem. Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO). 2008, 315-322."},{"issue":"11","key":"5510_CR11","doi-asserted-by":"publisher","first-page":"e209","DOI":"10.1371\/journal.pcbi.0030209","volume":"3","author":"MA Alekseyev","year":"2007","unstructured":"Alekseyev MA, Pevzner PA: Are There Rearrangement Hotspots in the Human Genome?. PLoS Computational Biology. 2007, 3 (11): e209-10.1371\/journal.pcbi.0030209.","journal-title":"PLoS Computational Biology"},{"issue":"5","key":"5510_CR12","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-957. 10.1101\/gr.082784.108.","journal-title":"Genome Research"},{"issue":"8","key":"5510_CR13","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2008.0080","volume":"15","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev MA: Multi-Break Rearrangements and Breakpoint Re-uses: from Circular to Linear Genomes. Journal of Computational Biology. 2008, 15 (8): 1117-1131. 10.1089\/cmb.2008.0080.","journal-title":"Journal of Computational Biology"},{"key":"5510_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-23038-7_29","volume":"6833","author":"AW Xu","year":"2011","unstructured":"Xu AW, Moret BME: GASTS: Parsimony Scoring under Rearrangements. Lecture Notes in Computer Science. 2011, 6833: 351-363. 10.1007\/978-3-642-23038-7_29.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-13-S19-S1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-13-S19-S1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-13-S19-S1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T22:53:03Z","timestamp":1581979983000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-13-S19-S1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":14,"journal-issue":{"issue":"S19","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["5510"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-13-s19-s1","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]},"article-number":"S1"}}