{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:44:53Z","timestamp":1781077493098,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T00:00:00Z","timestamp":1256947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00453-009-9362-8","type":"journal-article","created":{"date-parts":[[2009,10,30]],"date-time":"2009-10-30T14:04:46Z","timestamp":1256911486000},"page":"609-626","source":"Crossref","is-referenced-by-count":5,"title":["Spiraling and Folding: The Word View"],"prefix":"10.1007","volume":"60","author":[{"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Sedgwick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,31]]},"reference":[{"issue":"1\u20132","key":"9362_CR1","first-page":"103","volume":"44","author":"P. Alessandri","year":"1998","unstructured":"Alessandri, P., Berth\u00e9, V.: Three distance theorems and combinatorics on words. Enseign. Math. (2) 44(1\u20132), 103\u2013132 (1998)","journal-title":"Enseign. Math. (2)"},{"key":"9362_CR2","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S. Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. 45, 1607\u20131620 (1959)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9362_CR3","unstructured":"Cloitre, B.: Sequence A085002. http:\/\/www.research.att.com\/~njas\/sequences\/A085002 (2003)"},{"key":"9362_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0097-3165(74)90041-7","volume":"16","author":"R.C. Entringer","year":"1974","unstructured":"Entringer, R.C., Jackson, D.E., Schatz, J.A.: On nonrepetitive sequences. J. Comb. Theory Ser. A 16, 159\u2013164 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9362_CR5","doi-asserted-by":"crossref","unstructured":"Fraenkel, A.S., Simpson, J.R.: How many squares must a binary sequence contain? Electron. J.\u00a0Comb. 2 (1995)","DOI":"10.37236\/1196"},{"key":"9362_CR6","unstructured":"Graham, R.L.: Problem 1. In: Open Problems at 5th Hungarian Colloquium on Combinatorics (1976)"},{"key":"9362_CR7","first-page":"164","volume":"89","author":"T. Harju","year":"2006","unstructured":"Harju, T., Nowotka, D.: Binary words with few squares. Bull. Eur. Assoc. Theor. Comput. Sci. 89, 164 (2006)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"9362_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B 53, 1\u20134 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9362_CR9","series-title":"Cambridge Mathematical Library","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)"},{"key":"9362_CR10","volume-title":"Encyclopedia of Mathematics and Its Applications","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic combinatorics on words. In: Encyclopedia of Mathematics and Its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"issue":"4","key":"9362_CR11","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s00454-002-2891-4","volume":"28","author":"J. Pach","year":"2002","unstructured":"Pach, J., T\u00f3th, G.: Recognizing string graphs is decidable. Discrete Comput. Geom. 28(4), 593\u2013606 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9362_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.jcss.2003.07.002","volume":"68","author":"M. Schaefer","year":"2004","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Decidability of string graphs. J. Comput. Syst. Sci. 68(2), 319\u2013334 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9362_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-45655-4_40","volume-title":"Computing and Combinatorics","author":"M. Schaefer","year":"2002","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Algorithms for normal curves and surfaces. In: Computing and Combinatorics. Lecture Notes in Computer Science, vol.\u00a02387, pp.\u00a0370\u2013380. Springer, Berlin (2002)"},{"issue":"2","key":"9362_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003) (Special issue on STOC2002, Montreal, QC)","journal-title":"J. Comput. Syst. Sci."},{"key":"9362_CR15","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Computing Dehn twists and geometric intersection numbers in polynomial time. Technical report TR05-009, DePaul University (2005)"},{"key":"9362_CR16","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Spiraling and folding: the topological view. In: Bose,\u00a0P. (ed.) Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, 20\u201322 August 2007, Carleton University, Ottawa, Canada, pp.\u00a073\u201376 (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9362-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9362-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9362-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T10:14:52Z","timestamp":1590228892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9362-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,31]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9362"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9362-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,31]]}}}