IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v21y2011i3d10.1007_s10878-009-9262-5.html
   My bibliography  Save this article

On the generalized constrained longest common subsequence problems

Author

Listed:
  • Yi-Ching Chen

    (National Taiwan University)

  • Kun-Mao Chao

    (National Taiwan University)

Abstract

We investigate four variants of the longest common subsequence problem. Given two sequences X, Y and a constrained pattern P of lengths m, n, and ρ, respectively, the generalized constrained longest common subsequence (GC-LCS) problems are to find a longest common subsequence of X and Y including (or excluding) P as a subsequence (or substring). We propose new dynamic programming algorithms for solving the GC-LCS problems in O(mn ρ) time. We also consider the case where the number of constrained patterns is arbitrary.

Suggested Citation

  • Yi-Ching Chen & Kun-Mao Chao, 2011. "On the generalized constrained longest common subsequence problems," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 383-392, April.
    • Handle: RePEc:spr:jcomop:v:21:y:2011:i:3:d:10.1007_s10878-009-9262-5
    DOI: 10.1007/s10878-009-9262-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9262-5
    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-009-9262-5?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hsing-Yen Ann & Chang-Biau Yang & Chiou-Ting Tseng, 2014. "Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 800-813, November.

    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:21:y:2011:i:3:d:10.1007_s10878-009-9262-5. 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.