Word assembly through minimal forbidden words (Q2503298): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2061983309
@@ Property / OpenAlex ID: W2061983309 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4432976
@@ Property / cites work: Q4432976 / rank @@
+Normal rank
@@ Property / cites work @@
+Words and special factors
@@ Property / cites work: Words and special factors / rank @@
+Normal rank
@@ Property / cites work @@
+Words, univalent factors, and boxes
@@ Property / cites work: Words, univalent factors, and boxes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5458488
@@ Property / cites work: Q5458488 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata and forbidden words
@@ Property / cites work: Automata and forbidden words / 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 @@
+Forbidden Factors and Fragment Assembly
@@ Property / cites work: Forbidden Factors and Fragment Assembly / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737922
@@ Property / cites work: Q4737922 / rank @@
+Normal rank
@@ Property / cites work @@
+Words and forbidden factors
@@ Property / cites work: Words and forbidden factors / rank @@
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank