A new method for approximate indexing and dictionary lookup with one error (Q1044734): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2005.08.001
@@ Property / DOI: 10.1016/j.ipl.2005.08.001 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.08.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2044813797
@@ Property / OpenAlex ID: W2044813797 / rank @@
+Normal rank
@@ Property / cites work @@
+Text Indexing and Dictionary Matching with One Error
+Normal rank
@@ Property / cites work @@
+Q2753929
@@ Property / cites work: Q2753929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044326
@@ Property / cites work: Q3044326 / rank @@
+Normal rank
@@ Property / cites work @@
+Dictionary matching and indexing with errors and don't cares
+Normal rank
@@ Property / cites work @@
+Q4437504
@@ Property / cites work: Q4437504 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+A sublinear algorithm for approximate keyword searching
+Normal rank
@@ Property / cites work @@
+Asymptotical growth of a class of random trees
@@ Property / cites work: Asymptotical growth of a class of random trees / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic properties of data compression and suffix trees
+Normal rank
@@ Property / cites work @@
+On-line construction of suffix trees
@@ Property / cites work: On-line construction of suffix trees / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2005.08.001
@@ Property / DOI: 10.1016/J.IPL.2005.08.001 / rank @@
+Normal rank