Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Arslan, A.N., Eğecioğlu, Ö.: Dictionary look-up within small edit distance. Inter. J. of Found. of Comp. Sci. 15(1), 57–71 (2004)
2. Lecture Notes in Computer Science;G.S. Brodal,1996
3. Brodal, G.S., Velkatesh, S.: Improved bounds for dictionary look-up with one error. IPL 75, 57–59 (2000)
4. Cole, R., Gottlieb, L.-A., Lewenstein, N.: Dictionary matching and indexing with errors and don’t cares. In: Proc. The 36th ACM STOC, pp. 91–100 (2004)
5. Dolev, D., Harari, Y., Linial, N., Nisan, N., Parnas, M.: Neighborhood preserving hashing and approximate queries. In: Proc. The Fifth ACM SODA (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Selection of DNA Markers;IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews);2008-01
2. Fast Motif Search in Protein Sequence Databases;Computer Science – Theory and Applications;2006