The constrained shortest common supersequence problem

Adi, 2010, Repetition-free longest common subsequence, Discrete Appl. Math., 158, 1315, 10.1016/j.dam.2009.04.023 Alimonti, 2000, Some APX-completeness results for cubic graphs, Theor. Comput. Sci., 237, 123, 10.1016/S0304-3975(98)00158-3 Arslan, 2005, Algorithms for the constrained longest common subsequence problems, Int. J. Found. Comput. Sci., 16, 1099, 10.1142/S0129054105003674 Ausiello, 1999 Bonizzoni, 2007, Exemplar longest common subsequence, IEEE/ACM Trans. Comput. Biol. Bioinform., 4, 535, 10.1109/TCBB.2007.1066 Bonizzoni, 2010, Variants of constrained longest common subsequence, Inf. Process. Lett., 110, 877, 10.1016/j.ipl.2010.07.015 Chin, 2004, A simple algorithm for the constrained sequence problems, Inf. Process. Lett., 90, 175, 10.1016/j.ipl.2004.02.008 R. Clifford, Z. Gotthilf, M. Lewenstein, A. Popa, Restricted common superstring and restrict common supersequence, in: Proc. of CPM, 2011, pp. 467–478. Cormen, 2002 Downey, 1999 Ferreira, 2010, A branch-and-cut approach to the repetition-free longest common subsequence problem, Electron. Notes Discrete Math., 36, 527, 10.1016/j.endm.2010.05.067 Z. Gotthilf, M. Lewenstein, A. Popa, On shortest common superstring and swap permutations, in: Proc. of SPIRE 2010, 2010, pp. 270–278. Iliopoulos, 2008, New efficient algorithms for the LCS and constrained LCS problems, Inf. Process. Lett., 106, 13, 10.1016/j.ipl.2007.09.008 Jiang, 1995, On the approximation of shortest common supersequences and longest common subsequences, SIAM J. Comput., 24, 1122, 10.1137/S009753979223842X Maier, 1978, The complexity of some problems on subsequences and supersequences, J. ACM, 25, 322, 10.1145/322063.322075 Niedermeier, 2006 K. Ning, H. Kee Ng, H. Wai Leong, Finding patterns in biological sequences by longest common subsequences and shortest common supersequences, in: Proceedings of BIBE, 2006, pp. 53–60. S. Rahmann, The shortest common supersequence problem in a microarray production setting, in: Proceedings of European Conference on Computational Biology, 2003, pp. 156–161. Räihä, 1981, The shortest common supersequence problem over binary alphabet is NP-complete, Theor. Comput. Sci., 16, 187, 10.1016/0304-3975(81)90075-X Sacerdoti, 1977 Sankoff, 1999, Genome rearrangement with gene families, Bioinformatics, 11, 909, 10.1093/bioinformatics/15.11.909 Tsai, 2003, The constrained longest common subsequence problems, Inf. Process. Lett., 88, 173, 10.1016/j.ipl.2003.07.001 Wilkins, 1988