{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:31Z","timestamp":1725538351903},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047435"},{"type":"electronic","value":"9783642047442"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04744-2_7","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T09:16:13Z","timestamp":1253697373000},"page":"70-83","source":"Crossref","is-referenced-by-count":13,"title":["DCJ Median Problems on Linear Multichromosomal Genomes: Graph Representation and Fast Exact Solutions"],"prefix":"10.1007","author":[{"given":"Andrew Wei","family":"Xu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1177\/117693430800400004","volume":"4","author":"Z. Adam","year":"2008","unstructured":"Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bioinformatics\u00a04, 69\u201374 (2008)","journal-title":"Evol. Bioinformatics"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D. Bader","year":"2001","unstructured":"Bader, D., Moret, B., 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":"7_CR3","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res.\u00a012, 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"7_CR4","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":"7_CR5","first-page":"178","volume-title":"Proc. 27th ACM Symp. on Theory of Computing STOC 1995","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. In: Proc. 27th ACM Symp. on Theory of Computing STOC 1995, pp. 178\u2013189. ACM, New York (1995)"},{"key":"7_CR6","first-page":"581","volume-title":"Proc. 43rd IEEE Symp. on Foudations of Computer Science FOCS 1995","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. 43rd IEEE Symp. on Foudations of Computer Science FOCS 1995, pp. 581\u2013592. IEEE Computer Soc., Los Alamitos (1995)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-78604-7_23","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"R. Lenne","year":"2008","unstructured":"Lenne, R., Solnon, C., St\u00fctzle, T., Tannier, E., Birattari, M.: Reactive stochastic local search algorithms for the genomic median problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol.\u00a04972, pp. 266\u2013276. Springer, Heidelberg (2008)"},{"key":"7_CR8","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. Siepel","year":"2001","unstructured":"Siepel, A., Moret, B.: 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":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/978-3-642-02008-7_28","volume-title":"RECOMB 2009","author":"K. Swenson","year":"2009","unstructured":"Swenson, K., Rajan, V., Lin, Y., Moret, B.: Sorting signed permutations by inversions in o(nlogn) time. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 386\u2013399. Springer, Heidelberg (2009)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Swenson, K., To, Y., Tang, J., Moret, B.: Maximum independent sets of commuting and noninterfering inversions. In: Proc. 7th Asia-Pacific Bioinformatics Conf. APBC 2009, vol.\u00a010 (suppl. 1), p. S6 (2009)","DOI":"10.1186\/1471-2105-10-S1-S6"},{"key":"7_CR11","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 median and halving problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 1\u201313. Springer, Heidelberg (2008)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci.\u00a065(3), 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR13","series-title":"Advances in Bioinformatics and Computational Biology","first-page":"227","volume-title":"Proc. 5th Asia-Pacific Bioinformatics Conf. APBC 2007","author":"A. Xu","year":"2007","unstructured":"Xu, A.: The distance between randomly constructed genomes. In: Proc. 5th Asia-Pacific Bioinformatics Conf. APBC 2007. Advances in Bioinformatics and Computational Biology, vol.\u00a05, pp. 227\u2013236. Imperial College Press, London (2007)"},{"key":"7_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-87989-3_14","volume-title":"Comparative Genomics","author":"A. Xu","year":"2008","unstructured":"Xu, A.: A fast and exact algorithm for the median of three problem\u2014A graph decomposition approach. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 184\u2013197. Springer, Heidelberg (2008)"},{"key":"7_CR15","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)"},{"key":"7_CR16","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, 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"7_CR17","first-page":"138","volume-title":"Proc. 14th Pacific Symposium on Biocomputing PSB 2009","author":"M. Zhang","year":"2009","unstructured":"Zhang, M., Arndt, W., Tang, J.: An exact median solver for the DCJ distance. In: Proc. 14th Pacific Symposium on Biocomputing PSB 2009, pp. 138\u2013149. World Scientific, Singapore (2009)"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04744-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:29:59Z","timestamp":1552156199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}