Abstract
We study an alignment model for coding DNA sequences recently proposed by J. Hein that takes into account both DNA and protein information, and attempts to minimize the total amount of evolution at both DNA and protein levels. Assuming that the gap penalty function is affine, we design a quadratic time dynamic programming algorithm for the model. Although the algorithm theoretically solves an open question of Hein, its running time is impractical because of the large constant factor embedded in the quadratic time complexity function. We therefore consider a mild simplification of Hein's model and present a much more efficient algorithm for the simplified model. The algorithms have been implemented and tested on both real and simulated sequences, and it is found that they produce almost identical alignments in most cases.
Supported in part by NSERC Operating Grant OGP0046613 and Canadian Genome Analysis and Technology Grant GO-12278.
Supported in part by NSERC Operating Grant OGP0046613.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Dayhoff, et al., Atlas of Protein Sequence and Structure, 5 suppl. 3, pp. 345–352, 1978.
O. Gotoh, An improved algorithm for matching biological sequences, J. Mol. Biol. 162, pp. 705–708, 1981.
D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
J. Hein, An algorithm combining DNA and protein alignment, Journal of Theoretical Biology 167, pp. 169–174, 1994.
J. Hein and J. Støvlbaek, Genomic alignment, J. Mol. Evol. 38, pp. 310–316, 1994.
J. Hein and J. Støvlbaek, Combined DNA and protein alignment, Methods in Enzymology 266, pp. 402–418, 1996.
Y. Hua, An improved algorithm for combined DNA and protein alignment, M. Eng. Thesis, Department of Computer and Electrical Engineering, McMaster University, 1997.
S. Needlemann and C. Wunsch, A general method applicable to the search for similarities in the amino acid sequences of two proteins, J. Mol. Biol. 48, pp. 443–453, 1970.
C. Pedersen, Computational analysis of biological sequences, Manuscript, 1997.
D. Sankoff, Matching sequences under deletion/insertion constraints, Proc. Nat. Acad. Sci. 69(1), pp. 4–6, 1972.
D. Sankoff, R. Cedergren and G. Lapalme, Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA, J. Mol. Evol. 7, pp.133–149, 1976.
P. Sellers, On the theory and computation of evolutionary distances, SIAM J. Appl. Math. 26, pp. 787–793, 1974.
D. States, et al., Methods: A companion to methods in Enzymology 3, pp. 66–70, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hua, Y., Jiang, T., Wu, B. (1998). Aligning DNA sequences to minimize the change in protein. In: Farach-Colton, M. (eds) Combinatorial Pattern Matching. CPM 1998. Lecture Notes in Computer Science, vol 1448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030792
Download citation
DOI: https://doi.org/10.1007/BFb0030792
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64739-3
Online ISBN: 978-3-540-69054-2
eBook Packages: Springer Book Archive