1. Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M (2000) Indexing and dictionary matching with one error. J Algorithms, 37(2):309–325
2. Belazzougui D (2009) Faster and space-optimal edit distance “1” dictionary. In: Proceedings of the 20th annual symposium on combinatorial pattern matching (CPM), Lille, pp 154–167
3. Belazzougui D (2014) Improved space-time tradeoffs for approximate full-text indexing with one edit error. Algorithmica. doi:10.1007/s00453-014-9873-9
4. Buchsbaum AL, Goodrich MT, Westbrook JR (2000) Range searching over tree cross products. In: Proceedings of European symposium on algorithms, Saarbrücken, pp 120–131
5. Chan H-L, Lam T-W, Sung W-K, Tam S-L, Wong S-S (2011) A linear size index for approximate pattern matching. J Discr Algorithms 9(4):358–364