{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T19:40:08Z","timestamp":1743968408689,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319266"},{"type":"electronic","value":"9783642319273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31927-3_2","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T11:35:13Z","timestamp":1344598513000},"page":"13-24","source":"Crossref","is-referenced-by-count":2,"title":["Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Feijao","sequence":"first","affiliation":[]},{"given":"Joao","family":"Meidanis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"16","key":"2_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\u00a021(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"2_CR2","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"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Mira, C., Meidanis, J.: Sorting by block-interchanges and signed reversals. In: ITNG 2007, pp. 670\u2013676 (2007)","DOI":"10.1109\/ITNG.2007.184"},{"key":"2_CR4","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":"2_CR5","doi-asserted-by":"crossref","unstructured":"Meidanis, J., Dias, Z.: An Alternative Algebraic Formalism for Genome Rearrangements. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213\u2013223. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-94-011-4309-7_20"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1089\/cmb.2009.0025","volume":"17","author":"Y.L. Huang","year":"2010","unstructured":"Huang, Y.L., Lu, C.L.: Sorting by reversals, generalized transpositions, and translocations using permutation groups. Journal of Computational Biology\u00a017(5), 685\u2013705 (2010)","journal-title":"Journal of Computational Biology"},{"key":"2_CR7","series-title":"LNBI","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":"2_CR8","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P. Feij\u00e3o","year":"2011","unstructured":"Feij\u00e3o, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a08, 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"2-3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"M. Alekseyev","year":"2008","unstructured":"Alekseyev, M., Pevzner, P.: Multi-break rearrangements and chromosomal evolution. Theoretical Computer Science\u00a0395(2-3), 193\u2013202 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"M.D.V. Braga","year":"2010","unstructured":"Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. Journal of Computational Biology\u00a017(9), 1145\u20131165 (2010)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31927-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T19:25:54Z","timestamp":1743967554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31927-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319266","9783642319273"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31927-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}