Simple, compact and robust approximate string dictionary-Reference-Cited by-同舟云学术

Simple, compact and robust approximate string dictionary

Published:2014-09 Issue: Volume:28 Page:49-60
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Chegrane Ibrahim^ORCID,Belazzougui Djamal

Funder

ANR

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference22 articles.

1. Faster and space-optimal edit distance “1” dictionary;Belazzougui,2009

2. Compressed string dictionary look-up with edit distance one;Belazzougui,2012

3. Fast similarity search in peer-to-peer networks;Bocek,2008

4. Indexing methods for approximate dictionary searching: comparative analysis;Boytsov;ACM J. Exp. Algorithmics,2011

5. Super-linear indices for approximate dictionary searching;Boytsov,2012

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

1. Index Structures for Fast Similarity Search for Symbol Strings;Cybernetics and Systems Analysis;2019-09

2. Fast Algorithm for Vernier Search of Long Repeats in DNA Sequences with Bounded Error Density;Algorithms for Computational Biology;2018

3. Index Structures for Fast Similarity Search for Binary Vectors;Cybernetics and Systems Analysis;2017-09

4. A Practical Index for Approximate Dictionary Matching with Few Mismatches;Computing and Informatics;2017

5. Fast and Compact Hamming Distance Index;Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval;2016-07-07