Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics

Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert
Bioinformatics 18:S4–S16, Oct 2002

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!