IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v16y2008i3d10.1007_s10878-007-9132-y.html
   My bibliography  Save this article

Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time

Author

Listed:
  • Christian Ledergerber

    (Institute of Computational Science)

  • Christophe Dessimoz

    (Institute of Computational Science)

Abstract

Sequence alignment is a central problem in bioinformatics. The classical dynamic programming algorithm aligns two sequences by optimizing over possible insertions, deletions and substitutions. However, other evolutionary events can be observed, such as inversions, tandem duplications or moves (transpositions). It has been established that the extension of the problem to move operations is NP-complete. Previous work has shown that an extension restricted to non-overlapping inversions can be solved in O(n 3) with a restricted scoring scheme. In this paper, we show that the alignment problem extended to non-overlapping moves can be solved in O(n 5) for general scoring schemes, O(n 4log n) for concave scoring schemes and O(n 4) for restricted scoring schemes. Furthermore, we show that the alignment problem extended to non-overlapping moves, inversions and tandem duplications can be solved with the same time complexities. Finally, an example of an alignment with non-overlapping moves is provided.

Suggested Citation

  • Christian Ledergerber & Christophe Dessimoz, 2008. "Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time," Journal of Combinatorial Optimization, Springer, vol. 16(3), pages 263-278, October.
    • Handle: RePEc:spr:jcomop:v:16:y:2008:i:3:d:10.1007_s10878-007-9132-y
    DOI: 10.1007/s10878-007-9132-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9132-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-007-9132-y?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:16:y:2008:i:3:d:10.1007_s10878-007-9132-y. 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.