Skip to main content
SpringerLink
Log in

A Recursive Algorithm for Generalized Constraint SCS Problem

  • Short Communication
  • Published:
National Academy Science Letters Aims and scope Submit manuscript

Abstract

In this paper a constraint shortest common supersequence problem, i.e. the string including constraint shortest common supersequence problem was considered. Shortest common supersequence is known as classical problem in the area of strings and it is classified as NP-hard problem. For two input DNA sequences X and Y of length m and n respectively and the constraint DNA sequence P of length r, and the problem was to compute the shortest common supersequence of string X and Y including P as substring and the length of SCS must be minimum. Chen and Chao (J Comb Optim 21:383–392, 2011) proposed the same problem but with constraint as longest common subsequence and its solution in 2011. A recursive procedure for STR-IC-SCS problem was proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

References

  1. Fraser CB, Irving RW, Middendorf M (1996) Maximal common subsequences and minimal common super sequences. Inf Comput 124(2):145–153

    Article  Google Scholar 

  2. Itoga SY (1981) The string merging problem. BIT 21:20–30

    Article  Google Scholar 

  3. Tronicek Z (1996) Problems related to subsequences and super sequences. In: Proceedings of 6th international symposium on string processing and information retrieval, pp 199–205

  4. Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequences. Commun ACM 18(6):341–343

    Article  Google Scholar 

  5. Noaman MM, Jaradat AS (2011) Solving shortest common super sequence problem using artificial bee colony algorithm. Int J ACM Jordan 2(3):180–185

    Google Scholar 

  6. Ning K, Ng HK, Leong HW (2006) Finding patterns in biological sequences by longest common subsequences and shortest common super sequence. In: Proceedings of the sixth IEEE symposium on bioinformatics and bioengineering, pp 53–60

  7. Ning K, Leong HW (2006) Towards a better solution to the shortest common super sequence problem: the deposition and reduction algorithm. In: First international multi-symposiums on computer and computational sciences, pp 84–90

  8. Dondi R (2013) The constrained shortest common supersequence problem. J Discrete Algorithms 21(7):11–17

    Article  Google Scholar 

  9. Flores-Mendez A, Bernal-Urbina M (2010) Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1–6. doi:10.1109/CEC.2010.5586312

  10. Deorowicz S (2012) Quadratic-time algorithm for a string constrained LCS problem. Inf Process Lett 112(11):423–426

    Article  Google Scholar 

  11. Chen Y-C, Chao K-M (2011) On the generalized constrained longest common subsequence problems. J Comb Optim 21:383–392

    Article  Google Scholar 

  12. Wang L, Wang X, YingJie W, Zhu D (2013) A dynamic programming solution for generalized LCS problem. Inf Process Lett 113(19–21):723–728

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nagarro Software Pvt Ltd, New Delhi, India

    Kaish Mangal

  2. Department of Computer Science and Engineering, Thapar University, Patiala, India

    Ravinder Kumar

Authors
  1. Kaish Mangal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravinder Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravinder Kumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mangal, K., Kumar, R. A Recursive Algorithm for Generalized Constraint SCS Problem. Natl. Acad. Sci. Lett. 39, 273–276 (2016). https://doi.org/10.1007/s40009-016-0441-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40009-016-0441-5

Keywords

Search

Navigation