M. Adi, C. Braga, C. Fernandes, F. Ferreira, M. Martinez et al., Repetition-free longest common subsequence, Discrete Applied Mathematics, vol.158, issue.12, pp.1315-1324, 2010.
DOI : 10.1016/j.dam.2009.04.023

URL : https://hal.archives-ouvertes.fr/hal-00539257

L. Bergroth, H. Hakonen, and T. Raita, A survey of longest common subsequence algorithms, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.39-48, 2000.
DOI : 10.1109/SPIRE.2000.878178

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.75423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001

H. L. Bodlaender, S. Thomassé, and A. Yeo, Kernel Bounds for Disjoint Cycles and Disjoint Paths, ESA, pp.635-646, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00806805

P. Bonizzoni, G. D. Vedova, R. Dondi, G. Fertin, R. Rizzi et al., Exemplar Longest Common Subsequence, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.4, pp.535-543, 2007.
DOI : 10.1109/TCBB.2007.1066

URL : https://hal.archives-ouvertes.fr/hal-00417728

P. Bonizzoni, G. D. Vedova, R. Dondi, and Y. Pirola, Variants of constrained longest common subsequence, Information Processing Letters, vol.110, issue.20, pp.877-881, 2010.
DOI : 10.1016/j.ipl.2010.07.015

F. Y. Chin, A. D. Santis, A. L. Ferrara, N. L. Ho, and S. K. Kim, A simple algorithm for the constrained sequence problems, Information Processing Letters, vol.90, issue.4, pp.175-179, 2004.
DOI : 10.1016/j.ipl.2004.02.008

L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.91-106, 2011.
DOI : 10.1145/1374376.1374398

B. Fu and L. Zhang, A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance, ISBRA 2011, pp.297-305, 2011.
DOI : 10.1016/0022-5193(82)90384-8

S. Guillemot and F. Sikora, Finding and Counting Vertex-Colored Subtrees, MFCS 2010, pp.405-416, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00455134

T. Jiang and M. Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences, SIAM Journal on Computing, vol.24, issue.5, pp.1122-1139, 1995.
DOI : 10.1137/S009753979223842X

I. Koutis, Faster Algebraic Algorithms for Path and Packing Problems, LNCS, vol.5125, pp.575-586, 2008.
DOI : 10.1007/978-3-540-70575-8_47

I. Koutis and R. Williams, Limits and Applications of Group Algebras for Parameterized Problems, ICALP 2009, pp.653-664, 2009.

D. Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM, vol.25, issue.2, pp.322-336, 1978.
DOI : 10.1145/322063.322075

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

D. Sankoff, Genome rearrangement with gene families, Bioinformatics, vol.15, issue.11, pp.909-917, 1999.
DOI : 10.1093/bioinformatics/15.11.909

R. Williams, Finding paths of length k in time, Information Processing Letters, vol.109, issue.6, pp.315-318, 2009.
DOI : 10.1016/j.ipl.2008.11.004