{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:10:10Z","timestamp":1747177810157,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453205"},{"type":"electronic","value":"9783642453212"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45321-2_15","type":"book-chapter","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T13:48:50Z","timestamp":1417614530000},"page":"364-381","source":"Crossref","is-referenced-by-count":3,"title":["Hypertext Searching - A Survey"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM J. Comp.\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM J. Comp."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0029792","volume-title":"Combinatorial Pattern Matching","author":"T. Akutsu","year":"1993","unstructured":"Akutsu, T.: A linear time pattern matching algorithm between a string and a tree. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 1\u201310. Springer, Heidelberg (1993)"},{"key":"15_CR3","unstructured":"Amir, A.: Entry: Computer Science. In: Berenbaum, M. (ed.) Encyclopaedia Judaica, McMillan\u2019s Reference and Keter Publishing (2006)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-75530-2_4","volume-title":"String Processing and Information Retrieval","author":"A. Amir","year":"2007","unstructured":"Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of \u21131 and \u2113\u2009\u221e\u2009 rearrangement distances. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 39\u201349. Springer, Heidelberg (2007)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1221\u20131229 (2006)","DOI":"10.1145\/1109557.1109692"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-69068-9_13","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2008","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 118\u2013129. Springer, Heidelberg (2008)"},{"issue":"2","key":"15_CR7","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 J. Comp.\u00a023(2), 313\u2013323 (1994)","journal-title":"SIAM J. Comp."},{"issue":"1-2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2003.10.039","volume":"314","author":"A. Amir","year":"2004","unstructured":"Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. Theoretical Computer Science\u00a0314(1-2), 173\u2013187 (2004)","journal-title":"Theoretical Computer Science"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-61258-0_23","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"1996","unstructured":"Amir, A., Calinescu, G.: Alphabet independent and dictionary scaled matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 320\u2013334. Springer, Heidelberg (1996)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Giancarlo, R., Galil, Z., Park, K.: Dynamic dictionary matching. Journal of Computer and System Sciences\u00a049(2), 208\u2013222 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/inco.1995.1090","volume":"119","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M., Idury, R.M., La Poutr\u00e9, J.A., Sch\u00e4ffer, A.A.: Improved dynamic dictionary matching. Information and Computation\u00a0119(2), 258\u2013282 (1995)","journal-title":"Information and Computation"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-75520-3_11","volume-title":"Algorithms \u2013 ESA 2007","author":"A. Amir","year":"2007","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 99\u2013110. Springer, Heidelberg (2007)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1999.1063","volume":"35","author":"A. Amir","year":"2000","unstructured":"Amir, A., Lewenstein, N., Lewenstein, M.: Pattern matching in hypertext. J. of Algorithms\u00a035, 82\u201399 (2000)","journal-title":"J. of Algorithms"},{"key":"15_CR14","unstructured":"Andoni, A., Deza, M., Gupta, A., Indyk, P., Raskhodnikova, S.: Lower bounds for embedding of edit distance into normed spaces. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 523\u2013526 (2003)"},{"key":"15_CR15","unstructured":"Aviad, A.: Hypertalmud: a hypertext system for the babylonian talmud and its commentaries. Master\u2019s thesis, Bar-Ilan University, Department of Mathematics and Computer Science (1993)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Batu, T., Ergun, F., Sahinalp, C.: Oblivious string embeddings and edit distance approximations. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 792\u2013801 (2006)","DOI":"10.1145\/1109557.1109644"},{"key":"15_CR17","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":"15_CR18","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press and McGraw-Hill (1992)"},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TKDE.2003.1198388","volume":"15","author":"G. Cormode","year":"2003","unstructured":"Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using hamming norms (how to zero in). IEEE Transactions on Knowledge and Data Engineering\u00a015(3), 529\u2013540 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR20","unstructured":"Ferragina, P., Grossi, R.: Fast incremental text editing. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 531\u2013540 (1995)"},{"key":"15_CR21","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol.\u00a07, pp. 113\u2013125 (1974)"},{"key":"15_CR22","unstructured":"Fraenkel, A.S., Klein, S.T.: Information retrieval from annotated texts with applications to hypertext (submitted for publication, 1996)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45452-7_20","volume-title":"Combinatorial Pattern Matching","author":"K. Fredriksson","year":"2002","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 235\u2013248. Springer, Heidelberg (2002)"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proc. 41st IEEE FOCS, pp. 189\u2013197 (2000)","DOI":"10.1109\/SFCS.2000.892082"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-89097-3_22","volume-title":"String Processing and Information Retrieval","author":"O. Kapah","year":"2008","unstructured":"Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 224\u2013235. Springer, Heidelberg (2008)"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. In: Symposium on the Theory of Computing, vol.\u00a04, pp. 125\u2013136 (1972)","DOI":"10.1145\/800152.804905"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"1995","unstructured":"Kim, D.K., Park, K.: String matching in hypertext. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, Springer, Heidelberg (1995)"},{"key":"15_CR28","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":"15_CR29","unstructured":"Rao Kosaraju, S.: Efficient string matching (1987) (manuscript)"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G.M. Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science\u00a043, 239\u2013249 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"15_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of Algorithms\u00a010(2), 157\u2013169 (1989)","journal-title":"Journal of Algorithms"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Manber, U., Wu, S.: Approximate string matching with arbitrary cost for text and hypertext. In: Proc. Int\u2019l Workshop on Structural and Syntactic Pattern Recognition, pp. 22\u201333 (1992)","DOI":"10.1142\/9789812797919_0002"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02459948","volume":"50","author":"W. Miller","year":"1988","unstructured":"Miller, W., Myers, E.: Sequence comparison with concave weighting functions. Bulletin of Mathematical Biology\u00a050, 97\u2013120 (1988)","journal-title":"Bulletin of Mathematical Biology"},{"key":"15_CR34","volume-title":"Hypertext and Hypermedia","author":"J. Nielsen","year":"1993","unstructured":"Nielsen, J.: Hypertext and Hypermedia. Academic Press Professional, Boston (1993)"},{"key":"15_CR35","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"}],"container-title":["Lecture Notes in Computer Science","Language, Culture, Computation. Computing - Theory and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45321-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:49:13Z","timestamp":1747176553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45321-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642453205","9783642453212"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45321-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}