{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:27Z","timestamp":1725538347162},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_3","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:16:13Z","timestamp":1253711773000},"page":"24-35","source":"Crossref","is-referenced-by-count":2,"title":["Parking Functions, Labeled Trees and DCJ Sorting Scenarios"],"prefix":"10.1007","author":[{"given":"A\u00efda","family":"Ouangraoua","sequence":"first","affiliation":[]},{"given":"Anne","family":"Bergeron","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45784-4_23","volume-title":"Algorithms in Bioinformatics","author":"Y. Ajana","year":"2002","unstructured":"Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals - an application to test the replication-directed reversal hypothesis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, p. 300. Springer, Heidelberg (2002)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(98)00322-3","volume":"218","author":"E. Barcucci","year":"1999","unstructured":"Barcucci, E., del Lungo, A., Pergola, E.: Random generation of trees and other combinatorial objects. Theoretical Computer Science\u00a0218(2), 219\u2013232 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2007.1011","volume":"4","author":"S. B\u00e9rard","year":"2007","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a04(1), 4\u201316 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"3_CR4","unstructured":"Bergeron, A., Chauve, C., Hartman, T., St-onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: Proceedings Troisi\u00e8mes Journ\u00e9es Ouvertes Biologie Informatique Math\u00e9matiques, pp. 99\u2013108 (2002)"},{"key":"3_CR5","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":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TCBB.2008.16","volume":"5","author":"M.D.V. Braga","year":"2008","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 Transactions on Computational Biology and Bioinformatics\u00a05(3), 348\u2013356 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCBB.2007.1042","volume":"4","author":"Y. Diekmann","year":"2007","unstructured":"Diekmann, Y., Sagot, M.-F., Tannier, E.: Evolution under reversals: Parsimony and conservation of common intervals. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a04(2), 301\u2013309 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"3_CR8","unstructured":"Kalikow, L.H.: Enumeration of parking functions, allowable permutation pairs, and labeled trees. PhD thesis, Brandeis University (1999)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1137\/0114101","volume":"14","author":"A.G. Konheim","year":"1966","unstructured":"Konheim, A.G., Weiss, B.: An occupancy discipline and applications. SIAM Journal of Applied Mathematics\u00a014, 1266\u20131274 (1966)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-94-011-4309-7_6","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families","author":"A. McLysaght","year":"2000","unstructured":"McLysaght, A., Seoighe, C., Wolfe, K.H.: High frequency of inversions during eukaryote gene order evolution. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families, pp. 47\u201358. Kluwer Academic Press, Dordrecht (2000)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1093\/gbe\/evp015","volume":"1","author":"I. Mikl\u00f3s","year":"2009","unstructured":"Mikl\u00f3s, I., Darling, A.: Efficient sampling of parsimonious inversion histories with application to genome rearrangement in yersinia. Genome Biology and Evolution\u00a01(1), 153\u2013164 (2009)","journal-title":"Genome Biology and Evolution"},{"key":"3_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-32290-0_7","volume-title":"Comparative Genomics","author":"I. Mikl\u00f3s","year":"2005","unstructured":"Mikl\u00f3s, I., Hein, J.: Genome rearrangement in mitochondria and its computational biology. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 85\u201396. Springer, Heidelberg (2005)"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1089\/cmb.2007.A003","volume":"14","author":"M. Ozery-flato","year":"2007","unstructured":"Ozery-flato, M., Shamir, R.: Sorting by translocations via reversals theory. Journal of Computational Biology\u00a014(4), 408\u2013422 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"13","key":"3_CR14","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1073\/pnas.1330369100","volume":"100","author":"P. Pevzner","year":"2003","unstructured":"Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proceedings of National Academy of Sciences USA\u00a0100(13), 7672\u20137677 (2003)","journal-title":"Proceedings of National Academy of Sciences USA"},{"key":"3_CR15","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-32290-0_8","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Lefebvre, J.-F., Tillier, E.R.M., Maler, A., El-Mabrouk, N.: The distribution of inversion lengths in bacteria. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 97\u2013108. Springer, Heidelberg (2005)"},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1089\/cmb.2005.12.812","volume":"12","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. Journal of Computational Biology\u00a012(6), 812\u2013821 (2005)","journal-title":"Journal of Computational Biology"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/565196.565233","volume-title":"RECOMB 2002: Proceedings of the Sixth annual International Conference on Computational biology","author":"A.C. Siepel","year":"2002","unstructured":"Siepel, A.C.: An algorithm to enumerate all sorting reversals. In: RECOMB 2002: Proceedings of the Sixth annual International Conference on Computational biology, pp. 281\u2013290. ACM, New York (2002)"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"R.P. Stanley","year":"1986","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a0I. Wadsworth and Brookes\/Cole, Monterey, California (1986)"},{"issue":"2","key":"3_CR19","doi-asserted-by":"crossref","first-page":"20","DOI":"10.37236\/1335","volume":"4","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Parking functions and noncrossing partitions. Electronic Journal of Combinatorics\u00a04(2), R20 (1997)","journal-title":"Electronic Journal of Combinatorics"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics","author":"R.P. Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a0II. Cambridge University Press, Cambridge (1999)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Swenson, K.M., Dong, Y., Tang, J., Moret, B.M.E.: Maximum independent sets of commuting and noninterfering inversions. In: 7th Asia-Pacific Bioinformatics Conference ( to appear, 2009)","DOI":"10.1186\/1471-2105-10-S1-S6"},{"issue":"4","key":"3_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1089\/cmb.2007.A004","volume":"14","author":"A.W. Xu","year":"2007","unstructured":"Xu, A.W., Zheng, C., Sankoff, D.: Paths and cycles in breakpoint graphs of random multichromosomal genomes. Journal of Computational Biology\u00a014(4), 423\u2013435 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"16","key":"3_CR23","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"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T11:30:42Z","timestamp":1590147042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}