Login / Register Logged in as anonymous / My BiBiServ / Logout
Navigation
OMA
Welcome
Download
References
Authors: J. Stoye, K. Reinert, T. Will
OMA is a library of C++-classes for the optimal alignment of sequences, built upon the Library of Efficient Data structures and Algorithms (LEDA). The parts of the library build a hierarchical, modular system, so that one can rearrange blocks or replace predefined modules by ones own classes. OMA is described in the extended abstract Combining Divide-and-Conquer, the A*-Algorithm and Successive Realignment Approach to Speed up Multiple Sequence Alignment which has been presented at the German Conference on Bioinformatics, GCB 99.

Users of OMA are requested to cite :
Reinert, Knut and Stoye, Jens and Will, Torsten Combining Divide-and-Conquer, the A*-Algorithm and Successive Realignment Approach to Speed up Multiple Sequence, GCB 99 Proc, 1999
built on March 4 2015 (2:309435a620a1)