Optimal algorithms for computing the canonical form of a circular string (Q1190455): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(92)90137-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1969428672
@@ Property / OpenAlex ID: W1969428672 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm to check for polygon similarity
+Normal rank
@@ Property / cites work @@
+Fast parallel Lyndon factorization with applications
+Normal rank
@@ Property / cites work @@
+Parallel construction of a suffix tree with applications
+Normal rank
@@ Property / cites work @@
+Q3782811
@@ Property / cites work: Q3782811 / rank @@
+Normal rank
@@ Property / cites work @@
+Lexicographically least circular substrings
@@ Property / cites work: Lexicographically least circular substrings / rank @@
+Normal rank
@@ Property / cites work @@
+Factorizing words over an ordered alphabet
@@ Property / cites work: Factorizing words over an ordered alphabet / rank @@
+Normal rank
@@ Property / cites work @@
+Q3197327
@@ Property / cites work: Q3197327 / 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 @@
+Fast canonization of circular strings
@@ Property / cites work: Fast canonization of circular strings / rank @@
+Normal rank