Efficient Similarity Search in Very Large String Sets-Reference-Cited by-同舟云学术

Efficient Similarity Search in Very Large String Sets

Published:2012 Issue: Volume: Page:262-279
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fenz Dandy,Lange Dustin,Rheinländer Astrid,Naumann Felix,Leser Ulf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31235-9_18.pdf

Reference28 articles.

1. Lecture Notes in Computer Science;S.A. Aghili,2003

2. Behm, A., Vernica, R., Alsubaiee, S., Ji, S., Lu, J., Jin, L., Lu, Y., Li, C.: UCI Flamingo Package 4.0 (2011)

3. Bocek, T., Hunt, E., Stiller, B.: Fast Similarity Search in Large Dictionaries. Technical report, Department of Informatics, University of Zurich (2007)

4. Celikik, M., Bast, H.: Fast error-tolerant search on very large texts. In: Proc. of the ACM Symposium on Applied Computing (SAC), pp. 1724–1731 (2009)

5. Fickett, J.W.: Fast optimal alignment. Nucleic Acids Research 12(1), 175–179 (1984)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Comparative Study for String Metrics and the Feasibility of Joining them as Combined Text Similarity Measures;ARO-The Scientific Journal of Koya University;2017

2. An Adaptive Approach of Approximate Substring Matching;Database Systems for Advanced Applications;2016

3. An Adaptive Similarity Search in Massive Datasets;Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIII;2016

4. Efficient similarity search in scientific databases with feature signatures;Proceedings of the 27th International Conference on Scientific and Statistical Database Management;2015-06-29

5. MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance;Lecture Notes in Computer Science;2015