Parametric Sequence Alignment with Constraints |
| |
Authors: | Roland H. C. Yap |
| |
Affiliation: | (1) School of Computing, National University of Singapore, Singapore, 117543, Republic of Singapore |
| |
Abstract: | Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries. |
| |
Keywords: | constraint programming string alignment computational molecular biology approximate matching parametric alignment |
本文献已被 SpringerLink 等数据库收录! |
|