A branch-and-cut algorithm for multiple sequence alignment (Q2583133): Difference between revisions

@@ Property / cites work @@
+Potential function methods for approximately solving linear programming problems: theory and practice.
+Normal rank
@@ Property / cites work @@
+Compact vs. exponential-size LP relaxations
@@ Property / cites work: Compact vs. exponential-size LP relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+Compact optimization can outperform separation: a case study in structural proteomics
+Normal rank
@@ Property / cites work @@
+The Multiple Sequence Alignment Problem in Biology
+Normal rank
@@ Property / cites work @@
+Sequence comparison with mixed convex and concave costs
+Normal rank
@@ Property / cites work @@
+A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+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 @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Q3138930
@@ Property / cites work: Q3138930 / rank @@
+Normal rank