Journal of Combinatorial Optimization

, Volume 3, Issue 2, pp 227–245

Aligning DNA Sequences to Minimize the Change in Protein

  • Yufang Hua
  • Tao Jiang
  • Bin Wu
Article

DOI: 10.1023/A:1009889710983

Cite this article as:
Hua, Y., Jiang, T. & Wu, B. Journal of Combinatorial Optimization (1999) 3: 227. doi:10.1023/A:1009889710983

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 named Context-free Codon Alignment 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. Furthermore, we extend our model and design a heuristic algorithm to handle frame-shift errors and overlapping frames in coding regions.

DNA protein sequence alignment dynamic programming coding region reading frame codon 

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Yufang Hua
    • 1
  • Tao Jiang
    • 2
  • Bin Wu
    • 3
  1. 1.Dept 659IBM CanadaTorontoCanada
  2. 2.Department of Computing and SoftwareMcMaster UniversityHamiltonCanada
  3. 3.IBM Toronto LabNet. Commerce, ISDCDon MillsCanada

Personalised recommendations