Compressed indexes for approximate string matching (Q5961970): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-008-9263-2
@@ Property / DOI: 10.1007/s00453-008-9263-2 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3024776
@@ Property / cites work: Q3024776 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753929
@@ Property / cites work: Q2753929 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Size Index for Approximate Pattern Matching
+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 @@
+Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximate string matching using compressed suffix data structures
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Suffix Arrays: A New Method for On-Line String Searches
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Q4828998
@@ Property / cites work: Q4828998 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
+Normal rank
@@ Property / cites work @@
+Q4828936
@@ Property / cites work: Q4828936 / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / DOI @@
+.1007/S00453-008-9263-2
@@ Property / DOI: 10.1007/S00453-008-9263-2 / rank @@
+Normal rank