A new polynomial-time algorithm for linear programming
Combinatorica
Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
A branch-and-cut approach to physical mapping with end-probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A branch-and-cut algorithm for multiple sequence alignment
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Combinatorial optimization
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
A polyhedral approach to sequence alignment problems
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On the closest string and substring problems
Journal of the ACM (JACM)
Structural alignment of large—size proteins via lagrangian relaxation
Proceedings of the sixth annual international conference on Computational biology
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Banishing Bias from Consensus Sequences
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
The Maximum Weight Trace Problem in Multiple Sequence Alignment
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Sorting Permutations by Reversals Through Branch-and-Price
INFORMS Journal on Computing
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lagrangian approaches for a class of matching problems in computational biology
Computers & Mathematics with Applications
A new DNA-based approach to solve the maximum weight clique problem
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
A new DNA encoding method for traveling salesman problem
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Optimal protein threading by cost-splitting
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
The recent years have seen an impressive increase in the use of Integer Programming models for the solution of optimization problems originating in Molecular Biology. In this survey, some of the most successful Integer Programming approaches are described, while a broad overview of application areas being is given in modern Computational Molecular Biology.