A branch-and-cut algorithm for multiple sequence alignment

A polyhedral approach to RNA sequence structure alignment

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology

Bioinformatics and Constraints

Constraints

Two-Layer Planarization in Graph Drawing

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics

Integer programming models for computational biology problems

Journal of Computer Science and Technology - Special issue on bioinformatics

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

A graph approach to the threshold all-against-all substring matching problem

Journal of Experimental Algorithmics (JEA)

A lagrangian relaxation approach for the multiple sequence alignment problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Approximating border length for DNA microarray synthesis

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Efficient parameterized algorithm for biopolymer structure-sequence alignment

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Introduction to ABACUS - a branch-and-cut system11Partially supported by ESPRIT LTR Project no. 20244 - ALCOM-IT.

Operations Research Letters

Hardness and approximation of the asynchronous border minimization problem

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation