{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:10:15Z","timestamp":1725556215276},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131219"},{"type":"electronic","value":"9783642131226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13122-6_35","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T09:26:31Z","timestamp":1274347591000},"page":"368-379","source":"Crossref","is-referenced-by-count":6,"title":["O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List"],"prefix":"10.1007","author":[{"given":"Aaron","family":"Williams","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput.\u00a025(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"3372","DOI":"10.1016\/j.tcs.2008.04.045","volume":"410","author":"B. Chitturi","year":"2009","unstructured":"Chitturi, B., Fahle, W., Meng, Z., Morales, L., Shields, C.O., Sudborough, I.H., Voit, W.: An (18\/11)n upper bound for sorting by prefix reversals. Theoretical Computer Science\u00a0410, 3372\u20133390 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1008958800904","volume":"9","author":"H. Choset","year":"2000","unstructured":"Choset, H.: Coverage of known spaces: The boustrophedon cellular decomposition. Journal Autonomous Robots\u00a09(3), 247\u2013253 (2000)","journal-title":"Journal Autonomous Robots"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"D.S. Cohen","year":"1995","unstructured":"Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discrete Applied Mathematics\u00a061, 105\u2013120 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations and other combinatorial configurations. Journal of the ACM\u00a020(3), 500\u2013513 (1973)","journal-title":"Journal of the ACM"},{"key":"35_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G. Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Mathematics\u00a027, 47\u201357 (1979)","journal-title":"Discrete Mathematics"},{"key":"35_CR8","unstructured":"Goldstein, A.J., Graham, R.L.: Sequential generation by transposition of all the arrangements of n symbols. In: Bell Telephone Laboratories (Internal Memorandum), Murray Hill, NJ (1964)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. In: SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms, New Orleans, Louisiana, United States, pp. 178\u2013187 (1997)","DOI":"10.1145\/267521.267544"},{"key":"35_CR10","series-title":"volume 4 fasicle 2: Generating All Tuples and Permutations","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming. volume 4 fasicle 2: Generating All Tuples and Permutations. Addison-Wesley, Reading (2005)"},{"key":"35_CR11","volume-title":"The Art of Computer Programming, volume 4 fasicle 3: Generating All Combinations and Partitions","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, volume 4 fasicle 3: Generating All Combinations and Partitions. Addison-Wesley, Reading (2005)"},{"key":"35_CR12","volume-title":"The Art of Computer Programming, volume 4 fasicle 4: Generating All Trees, History of Combinatorial Generation","author":"D.E. Knuth","year":"2006","unstructured":"Knuth, D.E.: The Art of Computer Programming, volume 4 fasicle 4: Generating All Trees, History of Combinatorial Generation. Addison-Wesley, Reading (2006)"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1006\/jagm.1997.0889","volume":"25","author":"J.F. Korsh","year":"1997","unstructured":"Korsh, J.F., Lipschutz, S.: Generating multiset permutations in constant time. Journal of Algorithms\u00a025, 321\u2013335 (1997)","journal-title":"Journal of Algorithms"},{"key":"35_CR14","series-title":"Proc. of Symposium Appl. Math.","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/psapm\/010\/0113289","volume-title":"Combinatorial Analysis","author":"D.H. Lehmer","year":"1960","unstructured":"Lehmer, D.H.: Teaching combinatorial tricks to a computer. In: Combinatorial Analysis. Proc. of Symposium Appl. Math., vol.\u00a010, pp. 179\u2013193. American Mathematical Society, Providence (1960)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-75520-3_18","volume-title":"Algorithms \u2013 ESA 2007","author":"M. Mares","year":"2007","unstructured":"Mares, M., Straka, M.: Linear-time ranking of permutations. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 187\u2013193. Springer, Heidelberg (2007)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jcta.1996.0087","volume":"76","author":"J. Millar","year":"1996","unstructured":"Millar, J., Sloane, N.J.A., Young, N.E.: A new operation on sequences: the boustrouphedon transform. Journal of Comb. Theory, Series A\u00a076(1), 44\u201354 (1996)","journal-title":"Journal of Comb. Theory, Series A"},{"key":"35_CR17","unstructured":"Sloane, N.: (2010), http:\/\/www.research.att.com\/~njas\/sequences\/A055881"},{"key":"#cr-split#-35_CR18.1","unstructured":"Steinhaus, H.: One Hundred Problems in Elementary Mathematics. Pergamon Press, Oxford (1963);"},{"key":"#cr-split#-35_CR18.2","doi-asserted-by":"crossref","unstructured":"Reprinted by Dover Publications in 1979 (1979)","DOI":"10.1016\/0045-8732(79)90078-0"},{"key":"35_CR19","unstructured":"Wikipedia (2009), http:\/\/en.wikipedia.org\/wiki\/Boustrophedon"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: SODA 2009: The Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, USA (2009)","DOI":"10.1137\/1.9781611973068.107"},{"key":"35_CR21","unstructured":"YouTube. 2009 National Sweet Corn Eating Championship (2009), http:\/\/www.youtube.com\/watch?v=EUy56pBA-HY"},{"issue":"2","key":"35_CR22","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S. Zaks","year":"1984","unstructured":"Zaks, S.: A new algorithm for generation of permutations. BIT Numerical Mathematics\u00a024(2), 196\u2013204 (1984)","journal-title":"BIT Numerical Mathematics"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13122-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:49Z","timestamp":1606186909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13122-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131219","9783642131226"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13122-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}