A linear time algorithm for shortest cyclic cover of strings (Q2628807): 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/j.jda.2016.05.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2399175009
@@ Property / OpenAlex ID: W2399175009 / rank @@
+Normal rank
@@ Property / cites work @@
+On suffix extensions in suffix trees
@@ Property / cites work: On suffix extensions in suffix trees / rank @@
+Normal rank
@@ Property / cites work @@
+Rotations of Periodic Strings and Short Superstrings
+Normal rank
@@ Property / cites work @@
+Reverse engineering of compact suffix trees and links: a novel algorithm
+Normal rank
@@ Property / cites work @@
+The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Shortest Superstring Problem Using de Bruijn Graphs
+Normal rank
@@ Property / cites work @@
+Faster implementation of a shortest superstring approximation
+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 @@
+An efficient algorithm for the all pairs suffix-prefix problem
+Normal rank
@@ Property / cites work @@
+Q4234062
@@ Property / cites work: Q4234062 / rank @@
+Normal rank
@@ Property / cites work @@
+Lyndon Words and Short Superstrings
@@ Property / cites work: Lyndon Words and Short Superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding approximate shortest common superstrings
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2628807