{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:45:22Z","timestamp":1742921122605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319261225"},{"type":"electronic","value":"9783319261232"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26123-2_30","type":"book-chapter","created":{"date-parts":[[2015,12,4]],"date-time":"2015-12-04T00:17:38Z","timestamp":1449188258000},"page":"308-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Text Analysis with Enhanced Annotated Suffix Trees: Algorithms and Implementation"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Dubov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,5]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2, 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"11","key":"30_CR2","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1002\/spe.960","volume":"40","author":"M Barsky","year":"2010","unstructured":"Barsky, M., Stege, U., Thomo, A.: A survey of practical algorithms for suffix tree construction in external memory. Softw. Pract. Experience 40(11), 965\u2013988 (2010)","journal-title":"Softw. Pract. Experience"},{"key":"30_CR3","first-page":"49","volume-title":"Transactions of Scientific Conference on Analysis of Images, Social Networks and Texts (AIST)","author":"M Dubov","year":"2013","unstructured":"Dubov, M., Chernyak, E.: Annotated suffix trees: implementation details. Transactions of Scientific Conference on Analysis of Images, Social Networks and Texts (AIST), pp. 49\u201357. Springer, Switzerland (2013)"},{"issue":"10","key":"30_CR4","first-page":"15","volume":"22","author":"M Dubov","year":"2014","unstructured":"Dubov, M., Mirkin, B., Shal, A.: Automatic russian text processing system. Open Systems DBMS 22(10), 15\u201317 (2014)","journal-title":"Open Systems DBMS"},{"key":"30_CR5","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, Cambridge (1997)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Kinen, J, Sanders, P.: Simple Linear Work Suffix Array Construction. Automata, Languages and Programming. Lecture Notes in Computer Science, pp. 943\u20132719 (2003)","DOI":"10.1007\/3-540-45061-0_73"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T Kasai","year":"2001","unstructured":"Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Lin, D.: Automatic retrieval and clustering of similar words. In: Proceedings of the 17th International Conference on Computational Linguistics, pp. 768\u2013774 (1998)","DOI":"10.3115\/980432.980696"},{"issue":"5","key":"30_CR9","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"21","key":"30_CR10","first-page":"31","volume":"3","author":"B Mirkin","year":"2012","unstructured":"Mirkin, B., Chernyak, E., Chugunova, O.: Method of annotated suffix tree for scoring the extent of presence of a string in text. Bus. Inf. 3(21), 31\u201341 (2012)","journal-title":"Bus. Inf."},{"key":"30_CR11","unstructured":"Pampapathi, R.: Annotated suffix trees for text modelling and classification. Doctoral dissertation, Birkbeck College, University of London, Retrieved from CiteSeerX (2008)"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10994-006-9505-y","volume":"65","author":"R Pampapathi","year":"2006","unstructured":"Pampapathi, R., Mirkin, B., Levene, M.: A suffix tree approach to anti-spam email filtering. Mach. Learn. 65(1), 309\u2013338 (2006)","journal-title":"Mach. Learn."},{"key":"30_CR13","volume-title":"Python Text Processing with NLTK 2.0 Cookbook","author":"J Perkins","year":"2010","unstructured":"Perkins, J.: Python Text Processing with NLTK 2.0 Cookbook. Packt Publishing, Birmingham (2010)"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41(4), 589\u2013607 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"30_CR15","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_CR16","unstructured":"Wang, T.: Extracting Synonyms from Dictionary Definitions. Retrieved from Focus on Research, Master dissertation, University of Toronto (2009)"}],"container-title":["Communications in Computer and Information Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26123-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:01:34Z","timestamp":1559318494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26123-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319261225","9783319261232"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26123-2_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}