Methods and Heuristics for Optimal Multiple Alignments

• Optimal: dynamic programming

  • Pruning the hyperlattice (MSA)

• Heuristics:

  • tree alignments(ClustalW)
  • star alignments
  • sampling (Gibbs)
  • local profiling with iteration (PSI-Blast, ...)

Previous slide

Next slide

Back to first slide

View graphic version