{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:32Z","timestamp":1742913992913,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_30","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"338-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Suffix Tree Or Not a Suffix Tree?"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Starikovskaya","sequence":"first","affiliation":[]},{"given":"Hjalte Wedel","family":"Vildh\u00f8j","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38905-4_1","volume-title":"Combinatorial Pattern Matching","author":"A Apostolico","year":"2013","unstructured":"Apostolico, A., Crochemore, M., Farach-Colton, M., Galil, Z., Muthukrishnan, S.: Forty years of text indexing. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 1\u201310. Springer, Heidelberg (2013)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Takeda, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 208\u2013217. Springer, Heidelberg (2003)"},{"issue":"01","key":"30_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1142\/S0129626496000054","volume":"06","author":"D Breslauer","year":"1996","unstructured":"Breslauer, D., Hariharan, R.: Optimal parallel construction of minimal suffix and factor automata. Parallel Process. Lett. 06(01), 35\u201344 (1996)","journal-title":"Parallel Process. Lett."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2012.07.018","volume":"457","author":"D Breslauer","year":"2012","unstructured":"Breslauer, D., Italiano, G.F.: On suffix extensions in suffix trees. Theor. Comp. Sci. 457, 27\u201334 (2012)","journal-title":"Theor. Comp. Sci."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.jda.2014.07.002","volume":"28","author":"B Cazaux","year":"2014","unstructured":"Cazaux, B., Rivals, E.: Reverse engineering of compact suffix trees and links: a novel algorithm. J. Discrete Algorithms 28, 9\u201322 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"30_CR6","unstructured":"Cl\u00e9ment, J., Crochemore, M., Rindone, G.: Reverse engineering prefix tables. In: Proceedings of the 26th STACS, pp. 289\u2013300 (2009)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-13509-5_23","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C.S., Pissis, S.P., Tischler, G.: Cover array string reconstruction. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 251\u2013259. Springer, Heidelberg (2010)"},{"issue":"1","key":"30_CR8","first-page":"51","volume":"10","author":"JP Duval","year":"2005","unstructured":"Duval, J.P., Lecroq, T., Lefebvre, A.: Border array on bounded alphabet. J. Autom. Lang. Comb. 10(1), 51\u201360 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1051\/ita:2008030","volume":"43","author":"JP Duval","year":"2009","unstructured":"Duval, J.P., Lecroq, T., Lefebvre, A.: Efficient validation and construction of border arrays and validation of string matching automata. RAIRO Theor. Inform. Appl. 43, 281\u2013297 (2009)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita:2002012","volume":"36","author":"JP Duval","year":"2002","unstructured":"Duval, J.P., Lefebvre, A.: Words over an ordered alphabet and suffix permutations. RAIRO Theor. Inform. Appl. 36(3), 249\u2013259 (2002)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00224-013-9522-8","volume":"54","author":"P Gawrychowski","year":"2014","unstructured":"Gawrychowski, P., Je\u017c, A., Je\u017c, \u0141.: Validating the Knuth-Morris-Pratt failure function, fast and online. Theory Comput. Syst. 54(2), 337\u2013372 (2014)","journal-title":"Theory Comput. Syst."},{"key":"30_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"issue":"50","key":"30_CR13","doi-asserted-by":"publisher","first-page":"6959","DOI":"10.1016\/j.tcs.2011.09.008","volume":"412","author":"T I","year":"2011","unstructured":"I, T., Inenaga, S., Bannai, H., Takeda, M.: Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50), 6959\u20136981 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-00982-2_36","volume-title":"Language and Automata Theory and Applications","author":"T I","year":"2009","unstructured":"I, T., 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. 5457, pp. 422\u2013433. Springer, Heidelberg (2009)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-13509-5_22","volume-title":"Combinatorial Pattern Matching","author":"Tomohiro I.","year":"2010","unstructured":"I., Tomohiro, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki: Verifying a Parameterized Border Array in O(n\n                  $$^\\text{1.5 }$$) Time. In: Amir, Amihood, Parida, Laxmi (eds.) CPM 2010. LNCS, vol. 6129, pp. 238\u2013250. Springer, Heidelberg (2010)"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.dam.2013.02.033","volume":"163","author":"T I","year":"2014","unstructured":"I, T., Inenaga, S., Bannai, H., Takeda, M.: Inferring strings from suffix trees and links on a binary alphabet. Discrete Appl. Math. 163, 316\u2013325 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"22\u201324","key":"30_CR17","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ipl.2013.09.009","volume":"113","author":"G Kucherov","year":"2013","unstructured":"Kucherov, G., T\u00f3thm\u00e9r\u00e9sz, L., Vialette, S.: On the combinatorics of suffix arrays. Inf. Process. Lett. 113(22\u201324), 915\u2013920 (2013)","journal-title":"Inf. Process. Lett."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0377-0427(01)00577-5","volume":"42","author":"W Lu","year":"2002","unstructured":"Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a border array in linear time. J. Comb. Math. Comb. Comput. 42, 223\u2013236 (2002)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Starikovskaya, T., Vildh\u00f8j, H.W.: A suffix tree or not a suffix tree. arXiv (2014). http:\/\/arxiv.org\/abs\/1403.1364","DOI":"10.1007\/978-3-319-19315-1_30"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th FOCS (SWAT), pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:33:04Z","timestamp":1676943184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}