{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:49Z","timestamp":1725795949856},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_28","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T23:50:31Z","timestamp":1402530631000},"page":"273-282","source":"Crossref","is-referenced-by-count":0,"title":["On the DCJ Median Problem"],"prefix":"10.1007","author":[{"given":"Mingfu","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard M. E.","family":"Moret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"28_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11851561_16","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"issue":"16","key":"28_CR3","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\u00a021(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"28_CR4","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Whole genome duplications, multi-break rearrangements, and genome halving problem. In: Proc. 18th ACM-SIAM Symp. Discrete Algs. SODA 2007, pp. 665\u2013679. SIAM Press (2007)"},{"issue":"9","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"M.D. Braga","year":"2011","unstructured":"Braga, M.D., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol.\u00a018(9), 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Sun, R., Yu, J.: Approximating the double-cut-and-join distance between unsigned genomes. In: Proc. 9th RECOMB Workshop Compar. Genomics RECOMB-CG 2011, BMC Bioinformatics 12(S.9), S17 (2011)","DOI":"10.1186\/1471-2105-12-S9-S17"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Shao, M., Lin, Y.: Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. In: Proc. 10th RECOMB Workshop Compar. Genomics RECOMB-CG 2012, BMC Bioinformatics 13(S. 19), S13 (2012)","DOI":"10.1186\/1471-2105-13-S19-S13"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Shao, M., Lin, Y., Moret, B.M.E.: Sorting genomes with rearrangements and segmental duplications through trajectory graphs. In: Proc. 11th RECOMB Workshop Compar. Genomics RECOMB-CG 2013, BMC Bioinformatics 14(S. 15), S9 (2013)","DOI":"10.1186\/1471-2105-14-S15-S9"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Moret, B.M.E., Lin, Y., Tang, J.: Rearrangements in phylogenetic inference: Compare, model, or encode? In: Chauve, C., et al. (eds.) Models and Algorithms for Genome Evolution, Computational Biology, vol.\u00a019, pp. 147\u2013172. Springer (2013)","DOI":"10.1007\/978-1-4471-5298-9_7"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th ACM Symp. Theory of Computing STOC 1995, pp. 178\u2013189. ACM Press (1995)","DOI":"10.1145\/225058.225112"},{"issue":"5","key":"28_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol.\u00a08(5), 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"key":"28_CR12","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 J. Comput.\u00a015, 93\u2013113 (2003)","journal-title":"INFORMS J. Comput."},{"key":"28_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87361-7_1","volume-title":"Algorithms in Bioinformatics","author":"E. Tannier","year":"2008","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal genome median and halving problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 1\u201313. Springer, Heidelberg (2008)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44696-6_15","volume-title":"Algorithms in Bioinformatics","author":"A.C. Siepel","year":"2001","unstructured":"Siepel, A.C., Moret, B.M.E.: Finding an optimal inversion median: experimental results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 189\u2013203. Springer, Heidelberg (2001)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-45784-4_40","volume-title":"Algorithms in Bioinformatics","author":"B.M.E. Moret","year":"2002","unstructured":"Moret, B.M.E., Siepel, A.C., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 521\u2013536. Springer, Heidelberg (2002)"},{"issue":"8","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1089\/cmb.2008.0116","volume":"15","author":"W. Arndt","year":"2008","unstructured":"Arndt, W., Tang, J.: Improving reversal median computation using commuting reversals and cycle information. J. Comput. Biol.\u00a015(8), 1079\u20131092 (2008)","journal-title":"J. Comput. Biol."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Rajan, V., Xu, A.W., Lin, Y., Swenson, K.M., Moret, B.M.E.: Heuristics for the inversion median problem. In: Proc. 8th Asia-Pacific Bioinf. Conf. APBC 2010, BMC Bioinformatics 11(S. 1), S30 (2010)","DOI":"10.1186\/1471-2105-11-S1-S30"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, M., Arndt, W., Tang, J.: An exact solver for the DCJ median problem. In: Proc. 14th Pacific Symp. Biocomputing PSB 2009, pp. 138\u2013149 (2009)","DOI":"10.1142\/9789812836939_0014"},{"key":"28_CR19","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87361-7_3","volume-title":"Algorithms in Bioinformatics","author":"A.W. Xu","year":"2008","unstructured":"Xu, A.W., Sankoff, D.: Decompositions of multiple breakpoint graphs and rapid exact solutions to the median problem. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 25\u201337. Springer, Heidelberg (2008)"},{"issue":"5","key":"28_CR20","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1101\/gr.082784.108","volume":"19","author":"M.A. Alekseyev","year":"2009","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Breakpoint graphs and ancestral genome reconstructions. Genome Research\u00a019(5), 943\u2013957 (2009)","journal-title":"Genome Research"},{"issue":"10","key":"28_CR21","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1089\/cmb.2009.0087","volume":"16","author":"A.W. Xu","year":"2009","unstructured":"Xu, A.W.: A fast and exact algorithm for the median of three problem: A graph decomposition approach. J. Comput. Biol.\u00a016(10), 1369\u20131381 (2009)","journal-title":"J. Comput. Biol."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Aganezov, S., Alekseyev, M.A.: On pairwise distances and median score of three genomes under DCJ. In: Proc. 10th RECOMB Workshop Compar. Genomics RECOMB-CG 2012, BMC Bioinformatics 13(S.19), S1 (2012)","DOI":"10.1186\/1471-2105-13-S19-S1"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:22:48Z","timestamp":1558909368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}