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

Ernst Althaus Alberto Caprara Hans-Peter Lenhof Knut Reinert Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. 4-16 2002 conf/eccb/2002 ECCB db/conf/eccb/eccb2002.html#AlthausCLR02