{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T13:11:15Z","timestamp":1789996275603,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642047435","type":"print"},{"value":"9783642047442","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-04744-2_4","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:16:13Z","timestamp":1253711773000},"page":"36-47","source":"Crossref","is-referenced-by-count":6,"title":["Counting All DCJ Sorting Scenarios"],"prefix":"10.1007","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","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 Res.\u00a019, 943\u2013957 (2009)","journal-title":"Genome Res."},{"key":"4_CR2","unstructured":"Bergeron, A., Chauve, C., Hartmann, T., St-Onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: Proceedings of JOBIM 2002, pp. 99\u2013108 (2002)"},{"key":"4_CR3","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":"#cr-split#-4_CR4.1","doi-asserted-by":"crossref","unstructured":"Braga, M.D.V., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals with experiments and an application to evolution. IEEE\/ACM Trans. Comput. Biol. Bioinf.??5(3), 348???356 (2008);","DOI":"10.1109\/TCBB.2008.16"},{"key":"#cr-split#-4_CR4.2","unstructured":"Preliminary version in Proceedings of ISBRA 2007. LNCS (LNBI), vol.??4463, pp. 293???304 (2007)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"4_CR6","series-title":"LNBI","first-page":"24","volume-title":"RECOMB-CG 2009","author":"A. Ouangraoua","year":"2009","unstructured":"Ouangraoua, A., Bergeron, A.: Parking functions, labeled trees and DCJ sorting scenarios. In: Ciccarelli, F.D., Mikl\u00f3s, I. (eds.) RECOMB-CG 2009. LNCS (LNBI), vol.\u00a05817, pp. 24\u201335. Springer, Heidelberg (2009)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit Distance for Genome Comparison Based on Non-Local Operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1089\/10665270360688200","volume":"10","author":"A. Siepel","year":"2003","unstructured":"Siepel, A.: An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol.\u00a010, 575\u2013597 (2003)","journal-title":"J. Comput. Biol."},{"key":"4_CR9","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":"4_CR10","unstructured":"Zeilberger, D.: Yet another proof of Cayley\u2019s formula for the number of labelled trees, http:\/\/www.math.rutgers.edu\/~zeilberg\/mamarim\/mamarimPDF\/cayley.pdf"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:51:27Z","timestamp":1558554687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}