IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v3y1999i2d10.1023_a1009889710983.html
   My bibliography  Save this article

Aligning DNA Sequences to Minimize the Change in Protein

Author

Listed:
  • Yufang Hua

    (IBM Canada)

  • Tao Jiang

    (McMaster University)

  • Bin Wu

    (Net. Commerce, ISDC)

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.

Suggested Citation

  • Yufang Hua & Tao Jiang & Bin Wu, 1999. "Aligning DNA Sequences to Minimize the Change in Protein," Journal of Combinatorial Optimization, Springer, vol. 3(2), pages 227-245, July.
    • Handle: RePEc:spr:jcomop:v:3:y:1999:i:2:d:10.1023_a:1009889710983
    DOI: 10.1023/A:1009889710983
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009889710983
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009889710983?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:3:y:1999:i:2:d:10.1023_a:1009889710983. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.