{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T14:19:13Z","timestamp":1770560353252,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135088","type":"print"},{"value":"9783642135095","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_23","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"251-259","source":"Crossref","is-referenced-by-count":18,"title":["Cover Array String Reconstruction"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"German","family":"Tischler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-63246-8_14","volume-title":"Structures in Logic and Computer Science","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., Breslauer, D.: Of periods, quasiperiods, repetitions and covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 236\u2013248. Springer, Heidelberg (1997)"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A. Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theoretical Computer Science\u00a0119(2), 247\u2013265 (1993)","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Take, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 208\u2013217. Springer, Heidelberg (2003)"},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D. Breslauer","year":"1992","unstructured":"Breslauer, D.: An on-line string superprimitivity test. Information Processing Letters\u00a044(6), 345\u2013347 (1992)","journal-title":"Information Processing Letters"},{"key":"23_CR5","first-page":"289","volume-title":"26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)","author":"J. Clement","year":"2009","unstructured":"Clement, J., Crochemore, M., Rindone, G.: Reverse engineering prefix tables. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Dagstuhl, Germany, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009), \n                  \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1825"},{"issue":"1","key":"23_CR6","first-page":"51","volume":"10","author":"J.-P. Duval","year":"2005","unstructured":"Duval, J.-P., Lecroq, T., Lefebvre, A.: Border array on bounded alphabet. Journal of Automata, Languages and Combinatorics\u00a010(1), 51\u201360 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"23_CR7","first-page":"223","volume":"42","author":"F. Franek","year":"2002","unstructured":"Franek, F., Gao, S., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a Border array in linear time. Journal on Combinatorial Mathematics and Combinatorial Computing\u00a042, 223\u2013236 (2002)","journal-title":"Journal on Combinatorial Mathematics and Combinatorial Computing"},{"issue":"6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1142\/S0129054106004418","volume":"17","author":"F. Franek","year":"2006","unstructured":"Franek, F., Smyth, W.F.: Reconstructing a Suffix Array. International Journal of Foundations of Computer Science\u00a017(6), 1281\u20131295 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","first-page":"422","volume-title":"Language and Automata Theory and Applications","author":"I. Tomohiro","year":"2009","unstructured":"Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Counting parameterized border arrays for a binary alphabet. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 422\u2013433. Springer, Heidelberg (2009)"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y. Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica\u00a032(1), 95\u2013106 (2002)","journal-title":"Algorithmica"},{"key":"23_CR11","volume-title":"Algebraic Combinatorics on Words","year":"2001","unstructured":"Lothaire, M. (ed.): Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2001)"},{"key":"23_CR12","volume-title":"Applied Combinatorics on Words","year":"2005","unstructured":"Lothaire, M. (ed.): Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"}],"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-13509-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:56Z","timestamp":1619784356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}