{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T15:50:08Z","timestamp":1751212208747},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_24","type":"book-chapter","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T00:51:58Z","timestamp":1380502318000},"page":"206-217","source":"Crossref","is-referenced-by-count":1,"title":["On Two-Dimensional Lyndon Words"],"prefix":"10.1007","author":[{"given":"Shoshana","family":"Marcus","sequence":"first","affiliation":[]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity and its applications. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 440\u2013452 (1992)"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A. Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity in rectangular arrays. SIAM Journal on Computing\u00a027(1), 90\u2013106 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A. Amir","year":"1994","unstructured":"Amir, A., Benson, G., Farach, M.: An alphabet independent approach to two-dimensional pattern matching. SIAM Journal on Computing\u00a023(2), 313\u2013323 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01191471","volume":"28","author":"A. Apostolico","year":"1995","unstructured":"Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Mathematical Systems Theory\u00a028(2), 89\u2013108 (1995)","journal-title":"Mathematical Systems Theory"},{"issue":"9","key":"24_CR5","first-page":"611","volume":"8","author":"M. Chemillier","year":"2004","unstructured":"Chemillier, M.: Periodic musical sequences and Lyndon words. Soft Computing\u00a08(9), 611\u2013616 (2004)","journal-title":"Soft Computing"},{"issue":"16","key":"24_CR6","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20","author":"O. Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: Star: an algorithm to search for tandem approximate repeats. Bioinformatics\u00a020(16), 2812\u20132820 (2004)","journal-title":"Bioinformatics"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.jnt.2006.10.017","volume":"125","author":"B. Farhi","year":"2007","unstructured":"Farhi, B.: Nontrivial lower bounds for the least common multiple of some finite sequences of integers. Journal of Number Theory\u00a0125(2), 393\u2013411 (2007)","journal-title":"Journal of Number Theory"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Mathematics\u00a023(3), 207\u2013210 (1978)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D. Gusfield","year":"1992","unstructured":"Gusfield, D., Landau, G.M., Schieber, B.: An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters\u00a041(4), 181\u2013185 (1992)","journal-title":"Information Processing Letters"},{"issue":"5","key":"24_CR10","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1137\/S0097539792190157","volume":"25","author":"Z.M. Kedem","year":"1996","unstructured":"Kedem, Z.M., Landau, G.M., Palem, K.V.: Parallel suffix-prefix-matching algorithm and applications. SIAM Journal on Computing\u00a025(5), 998\u20131023 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR11","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a02. Addison Wesley (1998)"},{"key":"24_CR12","unstructured":"Koshy, T.: Elementary Number Theory with Applications, 2nd edn. Academic Press (2001)"},{"key":"24_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2005)"},{"issue":"2","key":"24_CR14","first-page":"212","volume":"77","author":"R.C. Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On burnside\u2019s problem. Transactions of the American Mathematical Society\u00a077(2), 212\u2013215 (1954)","journal-title":"Transactions of the American Mathematical Society"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Mucha, M.: Lyndon words and short superstrings. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 958\u2013972 (2013)","DOI":"10.1137\/1.9781611973105.69"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00453-012-9615-9","volume":"65","author":"S. Neuburger","year":"2013","unstructured":"Neuburger, S., Sokol, D.: Succinct 2D dictionary matching. Algorithmica\u00a065(3), 662\u2013684 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2009.10.015","volume":"110","author":"E. Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Gog, S.: Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Information Processing Letters\u00a0110(3), 123\u2013128 (2010)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T03:35:41Z","timestamp":1548732941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}