We consider the inverse parametric sequence alignment problem, where a sequence alignment is given and the task is to determine parameter values such that the given alignment is optimal at that parameter setting. We describe a O(mnlog n)-time algorithm for inverse global alignment without gap penalty and a O(mnlogm) time algorithm for global alignment with gap penalty, where m, n (n ≤ m) are the lengths of input strings. We then discuss algorithms for local alignment.
CITATION STYLE
Sun, F., Fernández-Baca, D., & Yu, W. (2002). Inverse parametric sequence alignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 97–106). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_12
Mendeley helps you to discover research relevant for your work.