{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:32:49Z","timestamp":1725557569942},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_7","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"63-75","source":"Crossref","is-referenced-by-count":3,"title":["The Property Suffix Tree with Dynamic Properties"],"prefix":"10.1007","author":[{"given":"Tsvi","family":"Kopelowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2008.01.006","volume":"395","author":"A. Amir","year":"2008","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theor. Comput. Sci.\u00a0395, 298\u2013310 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM\u00a020, 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1007352.1007374","volume-title":"Proc. 36th annual ACM Symposium on the Theory of Computing (STOC)","author":"R. Cole","year":"2004","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proc. 36th annual ACM Symposium on the Theory of Computing (STOC), pp. 91\u2013100. ACM Press, New York (2004)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Farach, M., Muthukrishnan, S.: Perfect Hashing for Strings: Formalization and Algorithms. In: Proc. 7th Combinatorial Pattern Matching Conference, pp. 130\u2013140 (1996)","DOI":"10.1007\/3-540-61258-0_11"},{"key":"7_CR5","unstructured":"Ferragina, P., Grossi, R.: Fast incremental text editing. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 531\u2013540 (1995)"},{"key":"7_CR6","unstructured":"Gu, M., Farach, M., Beigel, R.: An efficient algorithm for dynamic text indexing. In: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697\u2013704 (1994)"},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ipl.2007.09.004","volume":"105","author":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Faster index for property matching. Inf. Process. Lett.\u00a0105(6), 218\u2013223 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"18","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ipl.2009.06.009","volume":"109","author":"M.T. Juan","year":"2009","unstructured":"Juan, M.T., Liu, J.J., Wang, Y.L.: Errata for \u201cFaster index for property matching\u201c. Inf. Process. Lett.\u00a0109(18), 1027\u20131029 (2009)","journal-title":"Inf. Process. Lett."},{"key":"7_CR9","unstructured":"Jurka, J.: Origin and Evolution of Alu Repetitive Elements. In: The Impact of Short Interspersed Elements (SINEs) on the Host Genome, pp. 25\u201341 (1995)"},{"key":"7_CR10","unstructured":"Jurka, J.: Human Repetitive Elements. In: Molecular Biology and Biotechnology, pp. 438\u2013441 (1995)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"7_CR12","unstructured":"Kopelwoitz, T., Lewenstein, M.: Dynamic Weighted Ancestors. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), pp. 565\u2013574 (2003)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comp.\u00a06, 323\u2013350 (1977)","journal-title":"SIAM J. Comp."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. of the ACM"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. 37th FOCS, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"key":"7_CR16","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\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Letters\u00a06(3), 80\u201382 (1977)","journal-title":"Inf. Process. Letters"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"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_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T22:58:34Z","timestamp":1635548314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}