## Abstract

When aligning biological sequences, the choice of scoring scheme is critical. Even small changes in gap penalties, for example, can yield radically different alignments. A rigorous way to learn parameter values that are appropriate for biological sequences is through inverse parametric sequence alignment. Given a collection of examples of biologically correct reference alignments, this is the problem of finding parameter values that make the scores of the reference alignments be as close as possible to those of optimal alignments of their sequences. We extend prior work on inverse parametric alignment to partial examples, which contain regions where the reference alignment is not specified, and to an improved formulation based on minimizing the average error between the scores of the reference alignments and the scores of optimal alignments. Experiments on benchmark biological alignments show we can learn scoring schemes that generalize across protein families, and that boost the accuracy of multiple sequence alignment by as much as 25 percent.

Original language | English (US) |
---|---|

Article number | 4540089 |

Pages (from-to) | 546-556 |

Number of pages | 11 |

Journal | IEEE/ACM Transactions on Computational Biology and Bioinformatics |

Volume | 5 |

Issue number | 4 |

DOIs | |

State | Published - Oct 1 2008 |

## Keywords

- Affine gap penalties
- Cutting plane algorithms
- Inverse parametric sequence alignment
- Linear programming
- Substitution score matrices

## ASJC Scopus subject areas

- Biotechnology
- Genetics
- Applied Mathematics