Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.05.012
+Normal rank
@@ Property / OpenAlex ID @@
+W1969880101
@@ Property / OpenAlex ID: W1969880101 / rank @@
+Normal rank
@@ Property / cites work @@
+Real scaled matching
@@ Property / cites work: Real scaled matching / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient pattern matching with scaling
@@ Property / cites work: Efficient pattern matching with scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Real two dimensional scaled matching
@@ Property / cites work: Real two dimensional scaled matching / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient one-dimensional real scaled matching
@@ Property / cites work: Efficient one-dimensional real scaled matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching patterns in strings subject to multi-linear transformations
+Normal rank
@@ Property / cites work @@
+On the sorting-complexity of suffix tree construction
+Normal rank
@@ Property / cites work @@
+Constructing suffix arrays in linear time
@@ Property / cites work: Constructing suffix arrays in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+On-line construction of suffix trees
@@ Property / cites work: On-line construction of suffix trees / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the scaled indexing problem
+Normal rank