Repetition-free longest common subsequence (Q5901069): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.04.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2053419093
@@ Property / OpenAlex ID: W2053419093 / rank @@
+Normal rank
@@ Property / cites work @@
+Repetition-free longest common subsequence
@@ Property / cites work: Repetition-free longest common subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Exemplar Longest Common Subsequence
@@ Property / cites work: Exemplar Longest Common Subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+Q5457092
@@ Property / cites work: Q5457092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank