title: Heuristic alignment methods.
abstract: Computation of multiple sequence alignment (MSA) is usually formulated as a combinatory optimization problem of an objective function. Solving the problem for virtually all sensible objective functions is known to be NP-complete implying that some heuristics must be adopted. Several general strategies have been proven effective to obtain accurate MSAs in reasonable computational costs. This chapter is devoted to a brief summary of most successful heuristic approaches.
authors.affiliation: Computational Biology Research Center (CBRC), Tokyo, Japan.
authors.forename: Osamu
authors.initials: O
authors.lastname: Gotoh
mesh_terms: D019295:Computational Biology; D016415:Sequence Alignment / Q000379:methods*