A branch-and-cut algorithm for multiple sequence alignment.

Knut Reinert Hans-Peter Lenhof Petra Mutzel Kurt Mehlhorn John D. Kececioglu

Published in: RECOMB (1997)

Keyphrases

multiple sequence alignment
dynamic programming
similarity measure
objective function
knapsack problem
learning algorithm
np hard
memory efficient
multiple alignment
scheduling problem
simulated annealing
input data
search strategy
protein sequences
scoring function