Ernst Althaus
Software
The SCIL software package facilitates and accelerates the
implementation of exact solution algorithms for hard optimization
problems. It has been applied successfully in many different areas.
SCIL is based on an efficient branch-and-cut algorithm. However,
in contrast to other software, it allows to specify symbolic
constraints instead of linear constraints. Symbolic constraints
play an important role in Constraint Programming and make SCIL a
user-friendly tool, allowing even non-experts to easily access
powerful state-of-the-art optimization techniques.
Combinatorial Sequence Alignment (COSA) and Lagrangean Sequence Alignmnet (LASA):
Branch-and-bound algorithms for the multiple sequence alignment
problem, one of the most important problems in computational biology.
To obtain the software, please send me an email.
Minimum Steiner Trees in Hamming Distance / Phylogenetic Trees
with maximum parsimony:
A new pruning approach for the Steiner minimum tree problem in
Hamming metric that outperforms all previous exact implementations.
This well studied problem is also called the maximum parsimony problem
and is a has
applications in several fields of science such as computational
linguistics and computational biology.
To obtain the software, please send me an email.
d-place discource ordering:
An algorithm that computes optimal orderings of sentences into a
locally coherent discourse.
To obtain the software, please send me an email.
A LEDA Extension Package (LEP) for Curve Reconstruction Algorithms.
|
Personensuche
Impressum
Zum Seitenanfang