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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
