The selective fixing algorithm for the closest string problem (Q336747): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2013.07.017
@@ Property / DOI: 10.1016/j.cor.2013.07.017 / rank @@
-Normal rank
@@ 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.cor.2013.07.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2011389177
@@ Property / OpenAlex ID: W2011389177 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved LP-based algorithms for the closest string problem
+Normal rank
@@ Property / cites work @@
+Q4252342
@@ Property / cites work: Q4252342 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding similar regions in many strings
@@ Property / cites work: Finding similar regions in many strings / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithm and heuristic for the closest string problem
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm based on Lagrangian relaxation for the closest string problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2013.07.017
@@ Property / DOI: 10.1016/J.COR.2013.07.017 / rank @@
+Normal rank