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:

Sequence comparison with mixed convex and concave costs

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine