Discovering subword associations in strings in time linear in the output size (Q1026231): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2007.02.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2035160567
@@ Property / OpenAlex ID: W2035160567 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4347080
@@ Property / cites work: Q4347080 / rank @@
+Normal rank
@@ Property / cites work @@
+Discovery Science
@@ Property / cites work: Discovery Science / rank @@
+Normal rank
@@ Property / cites work @@
+The smallest automaton recognizing the subwords of a text
+Normal rank
@@ Property / cites work @@
+Q3024804
@@ Property / cites work: Q3024804 / rank @@
+Normal rank
@@ Property / cites work @@
+.1162/153244303322533197
@@ Property / cites work: 10.1162/153244303322533197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4849531
@@ Property / cites work: Q4849531 / 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 @@
+Discovery Science
@@ Property / cites work: Discovery Science / rank @@
+Normal rank
@@ Property / cites work @@
+Q4939994
@@ Property / cites work: Q4939994 / rank @@
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors: Simplification and Parallelization
+Normal rank
@@ Property / cites work @@
+Simple and flexible detection of contiguous repeats using a suffix tree
+Normal rank
@@ Property / cites work @@
+On-line construction of suffix trees
@@ Property / cites work: On-line construction of suffix trees / rank @@
+Normal rank