A two-tire index structure for approximate string matching with block moves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5667 LNCS, Issue , 2009, Pages 197-211

  Wang, Bin ^a,b   Xie, Long ^c   Wang, Guoren ^a,b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b NORTHEASTERN UNIVERSITY   (China)

^c LIAONING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE STRING MATCHING; EDIT DISTANCE; FILTER STRATEGY; INDEX STRUCTURE; NP COMPLETE PROBLEMS; REAL DATA SETS;

TECHNICAL PRESENTATIONS;

DATABASE SYSTEMS;

EID: 70349330017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04205-8_17     Document Type: Conference Paper

References (18)

1. Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, p. 85. Springer, Heidelberg (2002)
2. Shapira, D., Storer, J.A.: Edit distance with move operations. Journal of discrete algorithms 5, 380-392 (2007)
3. Kahveci, T., Singh, A.K.: An Efficient Index Structure for String Databases. In: VLDB (2001)
4. Ukkonen, E.: Approximate String-matching with q-grams and Maximal Matches. Theoretical Computer Science 92, 191-211 (1992)
5. Gravano, L., Ipeirotis, P.G., Jagadish, H.V.: Approximate String Joins in a Database (Almost) for Free. In: VLDB (2001)
6. Crochemore, M., Rytter,W.: Text Algorithms. Oxford University Press, UK (1995)
7. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational. Cambridge University Press, UK (1997)
8. Crochemore, M., Rytter, W.: Jewels of Stringology. World scientific, Singapore (2002)
9. Navarro, G.: A Guided Tour to Approximate String Matching. ACM computing surveys(CSUR) 33, 31-88 (2001)
10. Lopresti, D., Tomkins, A.: Block Edit Models for Approximate String Matching. Theoretical computer science 181, 159-179 (1997)
11. Cormode, G., Muthukrishnan, S.: The String Edit Distance Matching Problem with Moves. In: ACM-SIAM symposium on Discrete algorithms (2002)
12. Cormode, G., Muthukrishnan, S.: The String Edit Distance Matching Problem with Moves. ACM Transactions on Algorithms(TALG) 3, 2-21 (2007)
13. Kaplan, H., Shfrir, N.: The Greedy Algorithm for Edit Distance with Moves. Information Processing Letters 97, 23-27 (2006)
14. Navarro, G., Baeza-yates, R., Sutinen, E., Tarhio, J.: Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin 24, 19-27 (2001)
15. Navarro, G., Baeza-yates, R.: A Hybrid Indexing Method for Approximate String Matching. Journal of Discrete Algorithms 1, 205-239 (2000)
16. 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)
17. Li, C., Wang, B., Yang, X.: VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams. In: VLDB (2007)
18. Yang, X., Wang, B., Li, C.: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In: SIGMOD (2008)