{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:49Z","timestamp":1725533509719},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"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-02441-2_28","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"314-325","source":"Crossref","is-referenced-by-count":3,"title":["Average-Case Analysis of Perfect Sorting by Reversals"],"prefix":"10.1007","author":[{"given":"Mathilde","family":"Bouvel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marni","family":"Mishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Rossin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2005.06.016","volume":"300","author":"M.H. Albert","year":"2005","unstructured":"Albert, M.H., Atkinson, M.D.: Simple permutations and pattern restricted permutations. Discrete Math.\u00a0300, 1\u201315 (2005)","journal-title":"Discrete Math."},{"key":"28_CR2","first-page":"4","volume":"4","author":"M. Albert","year":"2003","unstructured":"Albert, M., Atkinson, M., Klazar, M.: The enumeration of simple permutations. J. Integer Seq.\u00a04, 03.4.4 (2003)","journal-title":"J. Integer Seq."},{"key":"28_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-32290-0_1","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C.: Conservation of combinatorial structures in evolution scenarios. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 1\u201314. Springer, Heidelberg (2005)"},{"key":"28_CR4","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 Trans. Comput. Biol. Bioinform.\u00a04, 4\u201316 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2007.10.012","volume":"106","author":"S. B\u00e9rard","year":"2008","unstructured":"B\u00e9rard, S., Chauve, C., Paul, C.: A more efficient algorithm for perfect sorting by reversals. Inform. Proc. Letters\u00a0106, 90\u201395 (2008)","journal-title":"Inform. Proc. Letters"},{"key":"28_CR6","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-87989-3_12","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2008","unstructured":"B\u00e9rard, S., Chauve, C., Paul, C., Tannier, E.: Perfect DCJ rearrangement. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 158\u2013169. Springer, Heidelberg (2008)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1137\/060651331","volume":"22","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discrete Math.\u00a022, 1022\u20131039 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"28_CR8","volume-title":"Mathematics of Evolution and Phylogeny","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Mathematics of Evolution and Phylogeny. Oxford University Press, Oxford (2005)"},{"key":"28_CR9","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res.\u00a012, 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1000234","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C. Chauve","year":"2008","unstructured":"Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian. PLoS Comput. Biol.\u00a04, e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"28_CR11","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 Trans. Comput. Biol. Bioinform.\u00a04, 301\u2013309 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"28_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30219-3_3","volume-title":"Algorithms in Bioinformatics","author":"M. Figeac","year":"2004","unstructured":"Figeac, M., Varr\u00e9, J.-S.: Sorting by reversals with common intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"28_CR13","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2008","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM\u00a046, 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00029-X","volume":"61","author":"L. Ibarra","year":"1997","unstructured":"Ibarra, L.: Finding pattern matchings for permutations. Inform. Proc. Letters\u00a061, 293\u2013295 (1997)","journal-title":"Inform. Proc. Letters"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1089\/cmb.2005.12.1289","volume":"12","author":"G.M. Landau","year":"2005","unstructured":"Landau, G.M., Parida, L., Weimann, O.: Gene proximity analysis across whole genomes via PQ trees. J. Comput. Biol.\u00a012, 1289\u20131306 (2005)","journal-title":"J. Comput. Biol."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Lefebvre, J.-F., El-Mabrouk, N., Tillier, E.R.M., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics, i190\u2013i196 (2003)","DOI":"10.1093\/bioinformatics\/btg1025"},{"key":"28_CR18","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences (2007), Published electronically, \n                  \n                    http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"28_CR19","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-87989-3_18","volume-title":"Comparative Genomics","author":"K. Swenson","year":"2008","unstructured":"Swenson, K., Lin, Y., Rajan, V., Moret, B.: Hurdles hardly have to be heeded. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 241\u2013251. Springer, Heidelberg (2008)"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on sorting by reversals. Discrete Appl. Math.\u00a0155, 881\u2013888 (2007)","journal-title":"Discrete Appl. Math."},{"key":"28_CR21","first-page":"320","volume-title":"RECOMB 1997","author":"D.B. Wilson","year":"1997","unstructured":"Wilson, D.B., Greenberg, D.S., Phillips, C.A.: Beyond islands: runs in clone-probe matrices. In: RECOMB 1997, pp. 320\u2013329. ACM Press, New York (1997)"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/S0219720008003254","volume":"6","author":"W. Xu","year":"2008","unstructured":"Xu, W.: The distribution of distances between randomly constructed genomes: Generating function, expectation, variance and limits. J. Bioinform. Comput. Biol.\u00a06, 23\u201336 (2008)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1093\/bioinformatics\/btn295","volume":"24","author":"W. Xu","year":"2008","unstructured":"Xu, W., Beno\u00eet, A., Sankoff, D.: Poisson adjacency distributions in genome comparison: multichromosomal, circular, signed and unsigned cases. Bioinformatics\u00a024, i146\u2013i152 (2008)","journal-title":"Bioinformatics"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1089\/cmb.2007.A004","volume":"14","author":"W. Xu","year":"2007","unstructured":"Xu, W., Zheng, C., Sankoff, D.: Paths and cycles in breakpoint graph of random multichromosomal genomes. J. Comput. Biol.\u00a014, 423\u2013435 (2007)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T15:49:26Z","timestamp":1552060166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}