{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:58:12Z","timestamp":1725512292551},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540720300"},{"type":"electronic","value":"9783540720317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72031-7_28","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T14:16:24Z","timestamp":1186323384000},"page":"305-316","source":"Crossref","is-referenced-by-count":2,"title":["A Fast and Exact Algorithm for the Perfect Reversal Median Problem"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bernt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Merkle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Bioinformatics","first-page":"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\u201315. Springer, Heidelberg (2005)"},{"issue":"1","key":"28_CR2","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., et al.: 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":"28_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-30219-3_2","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., et al.: Reconstructing ancestral gene orders using conserved intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 14\u201325. Springer, Heidelberg (2004)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/11561071_69","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., et al.: Computing common intervals of K permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"issue":"7","key":"28_CR6","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1089\/cmb.2006.13.1340","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. J. Comp. Biol.\u00a013(7), 1345\u20131354 (2006)","journal-title":"J. Comp. Biol."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1007\/11752578_132","volume-title":"Parallel Processing and Applied Mathematics","author":"M. Bernt","year":"2006","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: A parallel algorithm for solving the reversal median problem. In: Wyrzykowski, R., et al. (eds.) PPAM 2005. LNCS, vol.\u00a03911, pp. 1089\u20131096. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TCBB.2006.38","volume":"3","author":"M. Bernt","year":"2006","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Genome rearrangement based on reversals that preserve conserved intervals. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(3), 275\u2013288 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"28_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11875741_6","volume-title":"Computational Life Sciences II","author":"M. Bernt","year":"2006","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: The reversal median problem, common intervals, and mitochondrial gene orders. In: R. Berthold, M., Glen, R.C., Fischer, I. (eds.) CompLife 2006. LNCS (LNBI), vol.\u00a04216, pp. 52\u201363. Springer, Heidelberg (2006)"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1093\/bioinformatics\/btl300","volume":"23","author":"M. Bernt","year":"2007","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics\u00a023(2), e129\u2013e135 (2007)","journal-title":"Bioinformatics"},{"key":"28_CR11","unstructured":"Boore, J.L.: Mitochondrial gene arrangement database (2006), http:\/\/evogen.jgi.doe.gov\/"},{"issue":"1","key":"28_CR12","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.A.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res.\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Res."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A. Caprara","year":"2003","unstructured":"Caprara, A.: The reversal median problem. INFORMS Journal on Computing\u00a015(1), 93\u2013113 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","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.: 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_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/225058.225112","volume-title":"Proceedings of the twenty-seventh annual ACM symposium on Theory of computing","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pp. 178\u2013189. ACM Press, New York (1995)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Combinatorial Pattern Matching","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 207\u2013218. Springer, Heidelberg (2001)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-45784-4_40","volume-title":"Algorithms in Bioinformatics","author":"B. Moret","year":"2002","unstructured":"Moret, B., et al.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 521\u2013536. Springer, Heidelberg (2002)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Moret, B., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. In: Mathematics of Evolution and Phylogeny (2005)","DOI":"10.1093\/oso\/9780198566106.003.0012"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44696-6_15","volume-title":"Algorithms in Bioinformatics","author":"A. Siepel","year":"2001","unstructured":"Siepel, A., Moret, B.: Finding an optimal inversion median: Experimental results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 189\u2013203. Springer, Heidelberg (2001)"},{"key":"28_CR20","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances in sorting by reversals. Accepted at Discrete Applied Mathematics (2005)"},{"issue":"26","key":"28_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"2","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica\u00a02(26), 290\u2013309 (2000)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72031-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T07:58:44Z","timestamp":1708156724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72031-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540720300","9783540720317"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72031-7_28","relation":{},"subject":[]}}