{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:47:12Z","timestamp":1779896832275,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642042409","type":"print"},{"value":"9783642042416","type":"electronic"}],"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-04241-6_8","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:56:16Z","timestamp":1252936576000},"page":"85-96","source":"Crossref","is-referenced-by-count":10,"title":["SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Feij\u00e3o","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jo\u00e3o","family":"Meidanis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"7","key":"8_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1073\/pnas.22.7.448","volume":"22","author":"A.H. Sturtevant","year":"1936","unstructured":"Sturtevant, A.H., Dobzhansky, T.: Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. PNAS\u00a022(7), 448\u2013450 (1936)","journal-title":"PNAS"},{"issue":"6","key":"8_CR2","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1073\/pnas.36.6.344","volume":"36","author":"B. McClintock","year":"1950","unstructured":"McClintock, B.: The origin and behavior of mutable loci in maize. PNAS\u00a036(6), 344\u2013355 (1950)","journal-title":"PNAS"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J.H. Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. PNAS\u00a081(3), 814\u2013818 (1984)","journal-title":"PNAS"},{"key":"8_CR4","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 Ann. Symp. Theory of Computing STOC 1995 (1995)","DOI":"10.1145\/225058.225112"},{"issue":"1-3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","volume":"71","author":"S. Hannenhalli","year":"1996","unstructured":"Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math.\u00a071(1-3), 137\u2013151 (1996)","journal-title":"Discrete Appl. Math."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters\u00a060, 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math.\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Mira, C., Meidanis, J.: Sorting by block-interchanges and signed reversals. In: Proc. ITNG 2007, pp. 670\u2013676 (2007)","DOI":"10.1109\/ITNG.2007.184"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: Proc. SPIRE 2001, pp. 250\u2013253 (2001)","DOI":"10.1109\/SPIRE.2001.989776"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1186\/1471-2105-7-295","volume":"7","author":"C.L. Lu","year":"2006","unstructured":"Lu, C.L., Huang, Y.L., Wang, T.C., Chiu, H.T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics\u00a07, 295 (2006)","journal-title":"BMC Bioinformatics"},{"issue":"16","key":"8_CR12","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":"8_CR13","unstructured":"Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. In: Genome Inform. Ser. Workshop Genome Inform., vol.\u00a08, pp. 25\u201334 (1997)"},{"issue":"suppl. 1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1093\/bioinformatics\/17.suppl_1.S165","volume":"17","author":"B.M. Moret","year":"2001","unstructured":"Moret, B.M., Wang, L.S., Warnow, T., Wyman, S.K.: New approaches for reconstructing phylogenies from gene order data. Bioinformatics\u00a017(suppl. 1), S165\u2013S173 (2001)","journal-title":"Bioinformatics"},{"issue":"1","key":"8_CR15","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res.\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"8_CR16","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. Bioinform. Online\u00a04, 69\u201374 (2008)","journal-title":"Evol. Bioinform. Online"},{"key":"8_CR17","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":"8_CR18","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)"},{"key":"8_CR19","unstructured":"Bryant, D.: The complexity of the breakpoint median problem. Technical Report CRM-2579, Centre de recherches mathematiques, Universit\u00e9 de Montr\u00e9al (1998)"},{"key":"8_CR20","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":"8_CR21","series-title":"Annals of Discrete Mathematics","volume-title":"Matching theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. Annals of Discrete Mathematics, vol.\u00a029. North-Holland, Amsterdam (1986)"},{"key":"8_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-86659-3","volume-title":"Evolution by gene duplication","author":"S. Ohno","year":"1970","unstructured":"Ohno, S.: Evolution by gene duplication. Springer, Heidelberg (1970)"},{"issue":"6983","key":"8_CR23","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1038\/nature02424","volume":"428","author":"M. Kellis","year":"2004","unstructured":"Kellis, M., Birren, B.W., Lander, E.S.: Proof and evolutionary analysis of ancient genome duplication in the yeast saccharomyces cerevisiae. Nature\u00a0428(6983), 617\u2013624 (2004)","journal-title":"Nature"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TCBB.2007.1002","volume":"4","author":"M.A. Alekseyev","year":"2007","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Colored de Bruijn graphs and the genome halving problem. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a04(1), 98\u2013107 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-69733-6_28","volume-title":"Computing and Combinatorics","author":"J. Mixtacki","year":"2008","unstructured":"Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 276\u2013286. Springer, Heidelberg (2008)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Warren, R., Sankoff, D.: Genome aliquoting with double cut and join. BMC Bioinformatics\u00a010(suppl. 1), S2 (2009)","DOI":"10.1186\/1471-2105-10-S1-S2"},{"issue":"13","key":"8_CR27","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1093\/bioinformatics\/btn146","volume":"24","author":"C. Zheng","year":"2008","unstructured":"Zheng, C., Zhu, Q., Adam, Z., Sankoff, D.: Guided genome halving: hardness, heuristics and the history of the hemiascomycetes. Bioinformatics\u00a024(13), i96\u2013i104 (2008)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04241-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:20:11Z","timestamp":1558524011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04241-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042409","9783642042416"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04241-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}