{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:44Z","timestamp":1725536444687},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042041"},{"type":"electronic","value":"9783642042058"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04205-8_17","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T10:54:46Z","timestamp":1251284086000},"page":"197-211","source":"Crossref","is-referenced-by-count":1,"title":["A Two-Tire Index Structure for Approximate String Matching with Block Moves"],"prefix":"10.1007","author":[{"given":"Bin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Long","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45452-7_9","volume-title":"Combinatorial Pattern Matching","author":"D. Shapira","year":"2002","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, p. 85. Springer, Heidelberg (2002)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jda.2005.01.010","volume":"5","author":"D. Shapira","year":"2007","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. Journal of discrete algorithms\u00a05, 380\u2013392 (2007)","journal-title":"Journal of discrete algorithms"},{"key":"17_CR3","unstructured":"Kahveci, T., Singh, A.K.: An Efficient Index Structure for String Databases. In: VLDB (2001)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate String-matching with q-grams and Maximal Matches. Theoretical Computer Science\u00a092, 191\u2013211 (1992)","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V.: Approximate String Joins in a Database (Almost) for Free. In: VLDB (2001)"},{"key":"17_CR6","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, UK (1995)"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational. Cambridge University Press, UK (1997)"},{"key":"17_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World scientific, Singapore (2002)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A Guided Tour to Approximate String Matching. ACM computing surveys(CSUR)\u00a033, 31\u201388 (2001)","journal-title":"ACM computing surveys(CSUR)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D. Lopresti","year":"1997","unstructured":"Lopresti, D., Tomkins, A.: Block Edit Models for Approximate String Matching. Theoretical computer science\u00a0181, 159\u2013179 (1997)","journal-title":"Theoretical computer science"},{"key":"17_CR11","unstructured":"Cormode, G., Muthukrishnan, S.: The String Edit Distance Matching Problem with Moves. In: ACM-SIAM symposium on Discrete algorithms (2002)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1186810.1186812","volume":"3","author":"G. Cormode","year":"2007","unstructured":"Cormode, G., Muthukrishnan, S.: The String Edit Distance Matching Problem with Moves. ACM Transactions on Algorithms(TALG)\u00a03, 2\u201321 (2007)","journal-title":"ACM Transactions on Algorithms(TALG)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2005.08.010","volume":"97","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Shfrir, N.: The Greedy Algorithm for Edit Distance with Moves. Information Processing Letters\u00a097, 23\u201327 (2006)","journal-title":"Information Processing Letters"},{"key":"17_CR14","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Baeza-yates, R., Sutinen, E., Tarhio, J.: Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin\u00a024, 19\u201327 (2001)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"17_CR15","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-yates, R.: A Hybrid Indexing Method for Approximate String Matching. Journal of Discrete Algorithms\u00a01, 205\u2013239 (2000)","journal-title":"Journal of Discrete Algorithms"},{"key":"17_CR16","unstructured":"Kim, M.-s., Whang, K.-y., Lee, J.-g., Lee, M.-j.: n-Gram\/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure. In: VLDB (2005)"},{"key":"17_CR17","unstructured":"Li, C., Wang, B., Yang, X.: VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams. In: VLDB (2007)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, B., Li, C.: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376655"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04205-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:17:13Z","timestamp":1552141033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04205-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042041","9783642042058"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04205-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}