Solving the minimum common string partition problem with the help of ants (Q2363999): Difference between revisions

@@ Property / DOI @@
-.1007/s11786-017-0293-5
@@ Property / DOI: 10.1007/s11786-017-0293-5 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.4539
@@ Property / arXiv ID: 1401.4539 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical programming strategies for solving the minimum common string partition problem
+Normal rank
@@ Property / cites work @@
+An ant colony optimization algorithm for DNA sequencing by hybridization
+Normal rank
@@ Property / cites work @@
+The greedy algorithm for the minimum common string partition problem
+Normal rank
@@ Property / cites work @@
+Q4035642
@@ Property / cites work: Q4035642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5480099
@@ Property / cites work: Q5480099 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum common string partition problem: hardness and approximations
+Normal rank
@@ Property / cites work @@
+Minimum Common String Partition Revisited
@@ Property / cites work: Minimum Common String Partition Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the longest common subsequence for multiple biological sequences by ant colony optimization
+Normal rank
@@ Property / cites work @@
+Q4495193
@@ Property / cites work: Q4495193 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11786-017-0293-5
@@ Property / DOI: 10.1007/S11786-017-0293-5 / rank @@
+Normal rank