{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:55Z","timestamp":1725492475852},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442110"},{"type":"electronic","value":"9783540457848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_24","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:33:38Z","timestamp":1192530818000},"page":"316-330","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Expected Number of Inversions Given the Number of Breakpoints"],"prefix":"10.1007","author":[{"given":"Niklas","family":"Eriksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D. A. Bader","year":"2001","unstructured":"Bader, D. A., Moret, B. M. E., Yan, M.: A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experimental Study. Journal of Computational Biology, 8, 5 (2001), 483\u2013491","journal-title":"Journal of Computational Biology"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M. Blanchette","year":"1996","unstructured":"Blanchette, M., Kunisawa, T., Sankoff, D.: Parametric genome rearrangement. Gene 172 (1996), GC 11\u201317","journal-title":"Gene"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal of Discrete Mathematics 12 (1999), 91\u2013110","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A., Lancia, G.: Experimental and statistical analysis of sorting by reversals. Sankoff and Nadeau (eds.), Comparative Genomics (2000), 171\u2013183","DOI":"10.1007\/978-94-011-4309-7_16"},{"key":"24_CR5","volume-title":"Spectra of Graphs","author":"D. M. Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107, D. M., Doob, M., Sachs, H.: Spectra of Graphs. Johann Ambrosius Barth Verlag, Heidelberg, 1995"},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-44696-6_18","volume-title":"Algorithms in Bioinformatics","author":"N. Eriksen","year":"2001","unstructured":"Eriksen, N.: (1 + \u03b5)-Approximation of Sorting by Reversals and Transpositions. Algorithms in Bioinformatics, Proceedings of WABI 2001, LNCS 2149, 227\u2013237"},{"key":"24_CR7","unstructured":"Eriksen, N.: Expected number of inversions after a sequence of random adjacent transpositions \u2014 an exact expression. Preprint"},{"key":"24_CR8","unstructured":"Eriksen, N., Dalevi, D., Andersson, S. G. E., Eriksson, K.: Gene order rearrangements with Derange: weights and reliability. Preprint"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson, H., Eriksson, K., Sj\u00f6strand, J.: Expected inversion number after k adjacent transpositions Proceedings of Formal Power Series and Algebraic Combinatorics 2000, Springer Verlag, 677\u2013685","DOI":"10.1007\/978-3-662-04166-6_66"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations with reversals). Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (1995), 178\u2013189","DOI":"10.1145\/225058.225112"},{"key":"24_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An Algorithmic Approach","author":"P. Pevzner","year":"2000","unstructured":"Pevzner, P.: Computational Molecular Biology: An Algorithmic Approach. The MIT Press, Cambridge, MA 2000"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Sankoff, D., Blanchette, M.: Probability models for genome rearrangements and linear invariants for phylogenetic inference. Proceedings of RECOMB 1999, 302\u2013309","DOI":"10.1145\/299432.299506"},{"key":"24_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-44696-6_14","volume-title":"Algorithms in Bioinformatics","author":"L.-S. Wang","year":"2001","unstructured":"Wang, L.-S.: Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes. Algorithms in Bioinformatics, Proceedings of WABI 2001, LNCS 2149, 175\u2013188"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:24:07Z","timestamp":1556900647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}