A. Abboud, V. V. Williams, and O. Weimann, Consequences of Faster Alignment of Sequences, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14), pp.39-51, 2014.
DOI : 10.1007/978-3-662-43948-7_4

F. N. Abu-khzam, H. Fernau, M. A. Langston, S. Lee-cultura, and U. Stege, Charge and reduce: A fixed-parameter algorithm for String-to-String Correction, Discrete Optimization, vol.8, issue.1, pp.41-49, 2011.
DOI : 10.1016/j.disopt.2010.10.003

S. S. Adi, M. D. Braga, C. G. Fernandes, C. E. Ferreira, F. V. Martinez et al., Repetition-free longest common subsequence, Discrete Applied Mathematics, issue.12, pp.1581315-1324, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00428122

J. Alber, J. Gramm, J. Guo, and R. Niedermeier, Computing the similarity of two sequences with nested arc annotations, Theoretical Computer Science, vol.312, issue.2-3, pp.337-358, 2004.
DOI : 10.1016/j.tcs.2003.10.026

N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

A. Amir, Z. Gotthilf, B. R. Shalom, and L. Weighted, Weighted LCS, Journal of Discrete Algorithms, vol.8, issue.3, pp.273-281, 2010.
DOI : 10.1016/j.jda.2010.02.001
URL : http://doi.org/10.1016/j.jda.2010.02.001

A. Amir, Z. Gotthilf, and B. R. Shalom, Weighted Shortest Common Supersequence, Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE '11), pp.44-54, 2011.
DOI : 10.1126/science.1058040

A. Amir, G. M. Landau, J. C. Na, H. Park, K. Park et al., Efficient algorithms for consensus string problems minimizing both distance sum and radius, Theoretical Computer Science, vol.412, issue.39, pp.4125239-5246, 2011.
DOI : 10.1016/j.tcs.2011.05.034

A. Amir, H. Paryenty, and L. Roditty, Approximations and Partial Solutions for the Consensus Sequence Problem, Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE '11), pp.168-173, 2011.
DOI : 10.1287/moor.8.4.538

A. Amir, H. Paryenty, and L. Roditty, Configurations and Minority in the String Consensus Problem, Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE '12), pp.42-53, 2012.
DOI : 10.1007/s00453-015-9996-7

A. Amir, H. Paryenty, and L. Roditty, On the hardness of the Consensus String problem, Information Processing Letters, vol.113, issue.10-11, pp.10-11371, 2013.
DOI : 10.1016/j.ipl.2013.02.016

A. Amir, J. Ficler, L. Roditty, and O. S. Shalom, On the Efficiency of the Hamming C-Centerstring Problems, Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, pp.1-10, 2014.
DOI : 10.1007/978-3-319-07566-2_1

S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. Vialette, On the Approximability of Comparing Genomes with Duplicates, Journal of Graph Algorithms and Applications, vol.13, issue.1, pp.19-53, 2009.
DOI : 10.7155/jgaa.00175
URL : https://hal.archives-ouvertes.fr/hal-00159893

H. Aziz, S. Gaspers, J. Gudmundsson, S. Mackenzie, N. Mattei et al., Computational aspects of multi-winner approval voting, Proceedings of the 8th Multidisciplinary Workshop on Advances in Preference Handling, 2014.

C. Bachmaier, F. Brandenburg, A. Gleißner, and A. Hofmeier, On Maximum Rank Aggregation Problems, Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA '13), pp.14-27, 2013.
DOI : 10.1007/978-3-642-45278-9_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.410.4321

M. Basavaraju, F. Panolan, A. Rai, M. S. Ramanujan, and S. Saurabh, On the Kernelization Complexity of String Problems, 20th International Conference on Computing and Combinatorics (COCOON '14), pp.141-153, 2014.
DOI : 10.1007/978-3-319-08783-2_13

R. Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem, Journal of the ACM, vol.9, issue.1, pp.61-63, 1962.
DOI : 10.1145/321105.321111

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

N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. , Fixed-parameter algorithms for Kemeny rankings, Theoretical Computer Science, vol.410, issue.45, pp.4104554-4570, 2009.
DOI : 10.1016/j.tcs.2009.08.033

N. Betzler, J. Guo, C. Komusiewicz, and R. Niedermeier, Average parameterization and partial kernelization for computing medians, Journal of Computer and System Sciences, vol.77, issue.4, pp.774-789, 2011.
DOI : 10.1016/j.jcss.2010.07.005

N. Betzler, R. Bredereck, J. Chen, and R. Niedermeier, Studies in computational aspects of voting?a parameterized complexity perspective, The Multivariate Algorithmic Revolution and Beyond, pp.318-363, 2012.

N. Betzler, R. Bredereck, and R. Niedermeier, Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation, Autonomous Agents and Multi-Agent Systems, vol.34, issue.3, pp.721-748, 2014.
DOI : 10.1007/s10458-013-9236-y

R. Van-bevern, M. Mnich, R. Niedermeier, and M. Weller, Interval scheduling and colorful independent sets, Journal of Scheduling, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01349213

G. Blin, M. Crochemore, and S. Vialette, Algorithmic aspects of arcannotated sequences, Algorithms in Molecular Biology: Techniques, Approaches, and Applications, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00620821

G. Blin, P. Bonizzoni, R. Dondi, and F. Sikora, On the parameterized complexity of the repetition free longest common subsequence problem, Information Processing Letters, vol.112, issue.7, pp.272-276, 2012.
DOI : 10.1016/j.ipl.2011.12.009
URL : https://hal.archives-ouvertes.fr/hal-00637255

G. Blin, L. Bulteau, M. Jiang, P. J. Tejada, and S. Vialette, Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths, Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM '12), pp.138-148, 2012.
DOI : 10.1007/978-3-642-31265-6_11
URL : https://hal.archives-ouvertes.fr/hal-00683311

G. Blin, M. Jiang, and S. Vialette, The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences, Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE '12), pp.130-142, 2012.
DOI : 10.1007/978-3-642-34109-0_14
URL : https://hal.archives-ouvertes.fr/hal-00713431

H. L. Bodlaender, R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Wareham, Parameterized complexity analysis in computational biology, Bioinformatics, vol.11, issue.1, pp.49-57, 1995.
DOI : 10.1093/bioinformatics/11.1.49

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham, The parameterized complexity of sequence alignment and consensus, Theoretical Computer Science, vol.147, issue.1-2, pp.31-54, 1995.
DOI : 10.1016/0304-3975(94)00251-D

P. Bonizzoni and G. D. Vedova, The complexity of multiple sequence alignment with SP-score that is a metric, Theoretical Computer Science, vol.259, issue.1-2, pp.63-79, 2001.
DOI : 10.1016/S0304-3975(99)00324-2

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

P. Bonizzoni, R. Dondi, G. Mauri, and I. Zoppis, Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective, Algorithmica, vol.29, issue.3
DOI : 10.1007/s00453-014-9882-8

C. Boucher and B. Ma, Closest string with outliers, BMC Bioinformatics, vol.12, issue.Suppl 1, p.55, 2011.
DOI : 10.1186/1471-2105-12-S1-S55

C. Boucher and M. Omar, On the Hardness of Counting and Sampling Center Strings, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.6, pp.1843-1846, 2012.
DOI : 10.1109/TCBB.2012.84

C. Boucher, D. G. Brown, and S. Durocher, On the Structure of Small Motif Recognition Instances, Proceedings of the 15th International Symposium on String Processing and Information Retrieval, pp.269-281, 2008.
DOI : 10.1007/978-3-540-89097-3_26

C. Boucher, G. M. Landau, A. Levy, D. Pritchard, and O. Weimann, On approximating string selection problems with outliers, Theoretical Computer Science, vol.498, pp.107-114, 2013.
DOI : 10.1016/j.tcs.2013.05.037

F. Brandt, V. Conitzer, and U. Endriss, Computational social choice, Multiagent Systems, pp.213-283, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01504575

R. Bredereck, J. Chen, P. Faliszewski, J. Guo, R. Niedermeier et al., Parameterized algorithmics for computational social choice: Nine research challenges, Tsinghua Science and Technology, vol.19, issue.4, pp.358-373, 2014.
DOI : 10.1109/TST.2014.6867518

L. Bulteau and M. Jiang, Inapproximability of (1,2)-Exemplar Distance, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, issue.6, pp.1384-1390, 2013.
DOI : 10.1109/TCBB.2012.144
URL : https://hal.archives-ouvertes.fr/hal-01171579

L. Bulteau and C. Komusiewicz, Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable, Proceedings the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.102-121, 2014.
DOI : 10.1137/1.9781611973402.8
URL : https://hal.archives-ouvertes.fr/hal-01176597

L. Bulteau, G. Fertin, M. Jiang, and I. Rusu, Tractability and approximability of maximal strip recovery, Theoretical Computer Science, pp.440-44114
URL : https://hal.archives-ouvertes.fr/hal-00606167

L. Bulteau, G. Fertin, and I. Rusu, Sorting by Transpositions Is Difficult, SIAM Journal on Discrete Mathematics, vol.26, issue.3, pp.1148-1180, 2012.
DOI : 10.1137/110851390
URL : https://hal.archives-ouvertes.fr/hal-00606223

L. Bulteau, G. Fertin, C. Komusiewicz, and I. Rusu, A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications, Proceedings of the 13th International Workshop on Algorithms in Bioinformatics (WABI '13), pp.244-258, 2013.
DOI : 10.1007/978-3-642-40453-5_19
URL : https://hal.archives-ouvertes.fr/hal-00906903

L. Bulteau, G. Fertin, and I. Rusu, Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms, Journal of Discrete Algorithms, vol.19, issue.0, pp.1-22, 2013.
DOI : 10.1007/978-3-642-10631-6_72
URL : https://hal.archives-ouvertes.fr/hal-00826876

L. Bulteau, G. Fertin, and C. Komusiewicz, Reversal Distances for Strings with Few Blocks or Small Alphabets, Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM '14), pp.50-59, 2014.
DOI : 10.1007/978-3-319-07566-2_6
URL : https://hal.archives-ouvertes.fr/hal-01044938

A. Caprara, Sorting by reversals is difficult, Proceedings of the first annual international conference on Computational molecular biology , RECOMB '97, pp.75-83, 1997.
DOI : 10.1145/267521.267531

J. Chen, B. Chor, M. Fellows, X. Huang, D. W. Juedes et al., Tight lower bounds for certain parameterized NP-hard problems, Information and Computation, vol.201, issue.2, pp.216-231, 2005.
DOI : 10.1016/j.ic.2005.05.001

J. Chen, X. Huang, I. A. Kanj, and G. Xia, On the computational hardness based on linear FPT-reductions, Journal of Combinatorial Optimization, vol.6, issue.2, pp.231-247, 2006.
DOI : 10.1007/s10878-006-7137-6

J. Chen, Y. Liu, S. Lu, B. O. Sullivan, and I. Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem, Journal of the ACM, vol.55, issue.5, 2008.

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong et al., COMPUTING THE ASSIGNMENT OF ORTHOLOGOUS GENES VIA GENOME REARRANGEMENT, Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, pp.302-315, 2005.
DOI : 10.1142/9781860947322_0037

Y. Chen and K. Chao, On the generalized constrained longest common subsequence problems, Journal of Combinatorial Optimization, vol.21, issue.1, pp.383-392, 2011.
DOI : 10.1007/s10878-009-9262-5

Z. Chen, B. Fu, M. Jiang, and B. Zhu, On recovering syntenic blocks from comparative maps, Journal of Combinatorial Optimization, vol.4, issue.3, pp.307-318, 2009.
DOI : 10.1007/s10878-009-9233-x

Z. Chen and L. Wang, Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.5, pp.1400-1410, 2011.
DOI : 10.1109/TCBB.2011.21

Z. Chen, B. Ma, and L. Wang, A three-string approach to the closest string problem, Journal of Computer and System Sciences, vol.78, issue.1, pp.164-178, 2012.
DOI : 10.1016/j.jcss.2011.01.003

Z. Chen, B. Ma, and L. Wang, Randomized and Parameterized Algorithms for the Closest String Problem, Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM '14), pp.100-109, 2014.
DOI : 10.1007/978-3-319-07566-2_11

Z. Chen, W. Ma, and L. Wang, The Parameterized Complexity of the Shared Center Problem, Algorithmica, vol.21, issue.2, pp.269-293, 2014.
DOI : 10.1007/s00453-012-9730-7

M. Chimani, M. Woste, and S. Böcker, A Closer Look at the Closest String and Closest Substring Problem, Proceedings of the 30th Workshop on Algorithm Engineering and Experiments (ALENEX '11), pp.13-24, 2011.
DOI : 10.1137/1.9781611972917.2

D. A. Christie and R. W. Irving, Sorting Strings by Reversals and by Transpositions, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.193-206, 2001.
DOI : 10.1137/S0895480197331995

R. Clifford, Z. Gotthilf, M. Lewenstein, and A. Popa, Restricted Common Superstring and Restricted Common Supersequence, Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM '11), pp.467-478, 2011.
DOI : 10.4086/toc.2007.v003a006

A. Condon, J. Ma?uch, and C. Thachuk, Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis, Proceedings of the 14th Annual International Conference on Computing and Combinatorics (COCOON '08), pp.265-275, 2008.
DOI : 10.1007/978-3-540-69733-6_27

A. Condon, J. Ma?uch, and C. Thachuk, The complexity of string partitioning, Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM '12), pp.159-172, 2012.

M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, 2002.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795

M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, and T. Wale´nwale´n, Polynomialtime approximation algorithms for weighted LCS problem, Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM '11), pp.455-466, 2011.

P. Damaschke, Minimum Common String Partition Parameterized, Proceedings of the 8th International Workshop on Algorithms in Bioinformatics (WABI '08), pp.87-98, 2008.
DOI : 10.1007/978-3-540-87361-7_8

L. P. Dinu and A. Popa, On the Closest String via Rank Distance, Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM '12), pp.413-426, 2012.
DOI : 10.1007/978-3-642-31265-6_33

R. Dondi, The constrained shortest common supersequence problem, Journal of Discrete Algorithms, vol.21, pp.11-17, 2013.
DOI : 10.1016/j.jda.2013.03.004

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity . Texts in Computer Science, 2013.

I. Elias, Settling the Intractability of Multiple Alignment, Journal of Computational Biology, vol.13, issue.7, pp.1323-1339, 2006.
DOI : 10.1089/cmb.2006.13.1323

P. A. Evans and T. Wareham, Efficient Restricted-Case Algorithms for Problems in Computational Biology, Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, pp.27-49, 2011.
DOI : 10.1002/9780470892107.ch2

P. A. Evans, A. D. Smith, and H. T. Wareham, On the complexity of finding common approximate substrings, Theoretical Computer Science, vol.306, issue.1-3, pp.407-430, 2003.
DOI : 10.1016/S0304-3975(03)00320-7

E. Farhana and M. S. Rahman, Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited, Information Processing Letters, vol.112, issue.13, pp.562-565, 2012.
DOI : 10.1016/j.ipl.2012.04.007

M. R. Fellows, M. T. Hallett, and U. Stege, Analogs & duals of the MAST problem for sequences & trees, Journal of Algorithms, vol.49, issue.1, pp.192-216, 2003.
DOI : 10.1016/S0196-6774(03)00081-6

M. R. Fellows, J. Gramm, and R. Niedermeier, On The Parameterized Intractability Of Motif Search Problems*, Combinatorica, vol.26, issue.2, pp.141-167, 2006.
DOI : 10.1007/s00493-006-0011-4

M. R. Fellows, B. M. Jansen, and F. A. , Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity, European Journal of Combinatorics, vol.34, issue.3, pp.541-566, 2013.
DOI : 10.1016/j.ejc.2012.04.008

H. Fernau and M. L. Schmid, Pattern matching with variables: A multivariate complexity analysis, Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM '13), pp.83-94, 2013.

H. Fernau, M. L. Schmid, and Y. Villanger, On the Parameterised Complexity of String Morphism Problems, Proceedings of the 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '13) Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.55-66, 2013.
DOI : 10.1007/s00224-015-9635-3

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

M. Frances and A. Litman, On covering problems of codes, Theory of Computing Systems, pp.113-119, 1997.
DOI : 10.1007/BF02679443

A. Frank and É. Tardos, An application of simultaneous diophantine approximation in combinatorial optimization, Combinatorica, vol.4, issue.1, pp.49-65, 1987.
DOI : 10.1007/BF02579200

J. Gallant, D. Maier, and J. A. Storer, On finding minimal length superstrings, Journal of Computer and System Sciences, vol.20, issue.1, pp.50-58, 1980.
DOI : 10.1016/0022-0000(80)90004-5

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

T. P. Gevezes and L. S. Pitsoulis, The Shortest Superstring Problem, In Optimization in Science and Engineering, pp.189-227, 2014.
DOI : 10.1007/978-1-4939-0808-0_10

P. Giannopoulos, C. Knauer, and S. Whitesides, Parameterized Complexity of Geometric Problems, The Computer Journal, vol.51, issue.3, pp.372-384, 2008.
DOI : 10.1093/comjnl/bxm053

A. Goldstein, P. Kolman, and J. Zheng, Minimum Common String Partition Problem: Hardness and Approximations, Electronic Journal of Combinatorics, vol.12, 2005.
DOI : 10.1007/978-3-540-30551-4_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.1220

A. Golovnev, A. S. Kulikov, and I. Mihajlin, Solving 3-Superstring in 3 n/3 Time, Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS '13), pp.480-491, 2013.
DOI : 10.1007/978-3-642-40313-2_43

A. Golovnev, A. S. Kulikov, and I. Mihajlin, Solving SCS for bounded length strings in fewer than steps, Information Processing Letters, vol.114, issue.8, pp.421-425, 2014.
DOI : 10.1016/j.ipl.2014.03.004

Z. Gotthilf, D. Hermelin, and M. Lewenstein, Constrained LCS: Hardness and Approximation, Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM '08), pp.255-262, 2008.
DOI : 10.1007/978-3-540-69068-9_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.6334

Z. Gotthilf, D. Hermelin, G. M. Landau, and M. Lewenstein, Restricted LCS, Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE '10), pp.250-257, 2010.
DOI : 10.1007/978-3-642-16321-0_26

Z. Gotthilf, M. Lewenstein, and A. Popa, On Shortest Common Superstring and Swap Permutations, Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE '10), pp.270-278, 2010.
DOI : 10.1007/978-3-642-16321-0_28

J. Gramm, R. Niedermeier, and P. Rossmanith, Exact Solutions for Closest String and Related Problems, Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC '01), volume 2223 of LNCS, pp.441-453, 2001.
DOI : 10.1093/nar/27.19.3899

J. Gramm, R. Niedermeier, and P. Rossmanith, Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems, Algorithmica, vol.37, issue.1, pp.25-42, 2003.
DOI : 10.1007/s00453-003-1028-3

J. Gramm, J. Guo, and R. Niedermeier, Parameterized Intractability of Distinguishing Substring Selection, Theory of Computing Systems, vol.39, issue.4, pp.545-560, 2006.
DOI : 10.1007/s00224-004-1185-z

Q. Gu, P. Hell, and B. Yang, On the exact block cover problem, Proceedings of the 10th International Conference on Algorithmic Aspects in Information and Management (AAIM '14), pp.13-22, 2014.

S. Guillemot, Parameterized complexity and approximability of the Longest Compatible Sequence problem, Discrete Optimization, vol.8, issue.1, pp.50-60, 2011.
DOI : 10.1016/j.disopt.2010.08.003

J. Guo and R. Niedermeier, Invitation to data reduction and problem kernelization, ACM SIGACT News, vol.38, issue.1, pp.31-45, 2007.
DOI : 10.1145/1233481.1233493

J. Guo, F. Hüffner, and R. Niedermeier, A Structural View on Parameterizing Problems: Distance from Triviality, Proceedings of the 1st International Workshop on Parameterized and Exact Computation, pp.162-173, 2004.
DOI : 10.1007/978-3-540-28639-4_15

J. Guo, S. Hartung, R. Niedermeier, and O. Suchý, The Parameterized Complexity of Local Search for TSP, More Refined, Algorithmica, vol.8, issue.1, pp.89-110, 2013.
DOI : 10.1007/s00453-012-9685-8

J. Guo, D. Hermelin, and C. Komusiewicz, Local search for string problems: Brute-force is essentially optimal, Theoretical Computer Science, vol.525, pp.30-41, 2014.
DOI : 10.1016/j.tcs.2013.05.006
URL : https://hal.archives-ouvertes.fr/hal-01176607

M. T. Hallett, An Integrated Complexity Analysis of Problems from Computational Biology, Canada, 1998.

M. Held and R. M. Karp, A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.
DOI : 10.1137/0110015

D. Hermelin and L. Rozenberg, Parameterized complexity analysis for the closest string with wildcards problem, Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM '14), pp.140-149, 2014.

W. J. Hsu and M. W. Du, Computing a longest common subsequence for a set of strings, BIT, vol.28, issue.1, pp.45-59, 1984.
DOI : 10.1007/BF01934514

F. Hüffner, R. Niedermeier, and S. Wernicke, Techniques for Practical Fixed-Parameter Algorithms, The Computer Journal, vol.51, issue.1, pp.7-25, 2008.
DOI : 10.1093/comjnl/bxm040

F. Hufsky, L. Kuchenbecker, K. Jahn, J. Stoye, and S. Böcker, Swiftly Computing Center Strings, BMC Bioinformatics, vol.12, issue.1, p.106, 2011.
DOI : 10.1016/j.jda.2004.08.015
URL : http://doi.org/10.1186/1471-2105-12-106

J. W. Hunt and T. G. Szymanski, A fast algorithm for computing longest common subsequences, Communications of the ACM, vol.20, issue.5, pp.350-353, 1977.
DOI : 10.1145/359581.359603

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.8482

R. W. Irving and C. B. Fraser, Two algorithms for the longest common subsequence of three (or more) strings, Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching (CPM '92), pp.214-229, 1992.
DOI : 10.1007/3-540-56024-6_18

H. Jiang, Z. Li, G. Lin, L. Wang, and B. Zhu, Exact and approximation algorithms for??the??complementary maximal strip recovery problem, Journal of Combinatorial Optimization, vol.4, issue.7, pp.493-506, 2012.
DOI : 10.1007/s10878-010-9366-y

H. Jiang, B. Zhu, D. Zhu, and H. Zhu, Minimum common string partition revisited, Journal of Combinatorial Optimization, vol.155, issue.3, pp.519-527, 2012.
DOI : 10.1007/s10878-010-9370-2

M. Jiang, The Zero Exemplar Distance Problem, Journal of Computational Biology, vol.18, issue.9, pp.1077-1086, 2011.
DOI : 10.1089/cmb.2011.0097

W. Just, Computational Complexity of Multiple Sequence Alignment with SP-Score, Journal of Computational Biology, vol.8, issue.6, pp.615-623, 2001.
DOI : 10.1089/106652701753307511

R. Kannan, Minkowski's Convex Body Theorem and Integer Programming, Mathematics of Operations Research, vol.12, issue.3, pp.415-440, 1987.
DOI : 10.1287/moor.12.3.415

C. Komusiewicz and R. Niedermeier, New Races in Parameterized Algorithmics, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS '12), pp.19-30, 2012.
DOI : 10.1007/978-3-642-32589-2_2

S. Kratsch, Recent developments in kernelization: A survey, Bulletin of the EATCS, vol.113, pp.58-97, 2014.

T. Lee, J. C. Na, H. Park, K. Park, and J. S. Sim, Finding consensus and optimal alignment of circular strings, Theoretical Computer Science, vol.468, pp.92-101, 2013.
DOI : 10.1016/j.tcs.2012.11.018

H. W. Lenstra, Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983.
DOI : 10.1287/moor.8.4.538

M. Li, B. Ma, and L. Wang, Finding Similar Regions in Many Sequences, Journal of Computer and System Sciences, vol.65, issue.1, pp.73-96, 2002.
DOI : 10.1006/jcss.2002.1823

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), pp.760-776, 2011.
DOI : 10.1137/1.9781611973082.60

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the Exponential Time Hypothesis, Bulletin of the EATCS, vol.105, pp.41-71, 2011.

D. P. Lopresti and A. Tomkins, Block edit models for approximate string matching, Theoretical Computer Science, vol.181, issue.1, pp.159-179, 1997.
DOI : 10.1016/S0304-3975(96)00268-X

B. Ma and X. Sun, More Efficient Algorithms for Closest String and Substring Problems, SIAM Journal on Computing, vol.39, issue.4, pp.1432-1443, 2009.
DOI : 10.1137/080739069

M. Mahajan and V. Raman, Parameterizing above Guaranteed Values: MaxSat and MaxCut, Journal of Algorithms, vol.31, issue.2, pp.335-354, 1999.
DOI : 10.1006/jagm.1998.0996

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

D. Marx, Closest Substring Problems with Small Distances, SIAM Journal on Computing, vol.38, issue.4, pp.1382-1410, 2008.
DOI : 10.1137/060673898

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.728

D. Marx, Searching the k-change neighborhood for TSP is W[1]-hard, Operations Research Letters, vol.36, issue.1, pp.31-36, 2008.
DOI : 10.1016/j.orl.2007.02.008

D. Marx, Fixed-parameter tractable scheduling problems, Packing and Scheduling Algorithms for Information and Communication Services, 2011.

D. Meister, Using swaps and deletes to make strings match, Theoretical Computer Science, vol.562, 2014.
DOI : 10.1016/j.tcs.2014.11.002

M. Middendorf, More on the complexity of common superstring and supersequence problems, Theoretical Computer Science, vol.125, issue.2, pp.205-228, 1994.
DOI : 10.1016/0304-3975(92)00074-2

M. Middendorf, Shortest common superstrings and scheduling with coordinated starting times, Theoretical Computer Science, vol.191, issue.1-2, pp.205-214, 1998.
DOI : 10.1016/S0304-3975(97)00133-3

M. Mnich and A. Wiese, Scheduling and fixed-parameter tractability, 17th International Conference on Integer Programming and Combinatorial Optimization (IPCO '14), pp.381-392, 2014.
DOI : 10.1007/s10107-014-0830-9

C. Moan and I. Rusu, Hard problems in similarity searching, Discrete Applied Mathematics, vol.144, issue.1-2, pp.213-227, 2004.
DOI : 10.1016/j.dam.2004.06.003
URL : https://hal.archives-ouvertes.fr/hal-00455436

N. S. Narayanaswamy, V. Raman, M. S. Ramanujan, and S. Saurabh, LP can be a cure for parameterized problems, Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS '12), LIPIcs Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.338-349, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678200

F. Nicolas and E. Rivals, Hardness results for the center and median string problems under the weighted and unweighted edit distances, Journal of Discrete Algorithms, vol.3, issue.2-4, pp.390-415, 2005.
DOI : 10.1016/j.jda.2004.08.015
URL : https://hal.archives-ouvertes.fr/lirmm-00105320

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

R. Niedermeier, Reflections on multivariate algorithmics and problem parameterization, Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS '10), volume 5 of LIPIcs Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.17-32, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00456146

N. Nishimura and N. Simjour, Enumerating Neighbour and Closest Strings, Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC '12), pp.252-263
DOI : 10.1007/978-3-642-33293-7_24

P. A. Pevzner, Computational Molecular Biology: An Algorithmic Approach, 2000.

K. Pietrzak, On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems, Journal of Computer and System Sciences, vol.67, issue.4, pp.757-771, 2003.
DOI : 10.1016/S0022-0000(03)00078-3

W. Plandowski, Satisfiability of word equations with constants is in PSPACE, Journal of the ACM, vol.51, issue.3, pp.483-496, 2004.
DOI : 10.1145/990308.990312

A. Radcliffe, A. Scott, and E. Wilmer, Reversals and Transpositions Over Finite Alphabets, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.224-244, 2005.
DOI : 10.1137/S0895480103433550

D. Reidenbach and M. L. Schmid, Patterns with bounded treewidth. Information and Computation, 2014.

S. S. Skiena, The Algorithm Design Manual, 2010.
DOI : 10.1007/978-1-84800-070-4

K. M. Swenson, M. Marron, J. V. Earnest-deyoung, and B. M. Moret, Approximating the true evolutionary distance between two genomes, Journal of Experimental Algorithmics, vol.12, 2008.
DOI : 10.1145/1227161.1402297

V. G. Timkovskii, Complexity of common subsequence and supersequence problems and related problems, Cybernetics, vol.2, issue.No. 1, pp.565-580, 1989.
DOI : 10.1007/BF01075212

Y. Tsai, The constrained longest common subsequence problem, Information Processing Letters, vol.88, issue.4, pp.173-176, 2003.
DOI : 10.1016/j.ipl.2003.07.001

V. Vassilevska, Explicit Inapproximability Bounds for the Shortest Superstring Problem, Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS '05), pp.793-800, 2005.
DOI : 10.1007/11549345_68

R. A. Wagner, On the complexity of the Extended String-to-String Correction Problem, Proceedings of seventh annual ACM symposium on Theory of computing , STOC '75, pp.218-223, 1975.
DOI : 10.1145/800116.803771

L. Wang and B. Zhu, Efficient Algorithms for the Closest String and Distinguishing String Selection Problems, Proceedings of the 3rd International Workshop on Frontiers in Algorithmics, pp.261-270, 2009.
DOI : 10.1007/s00453-003-1028-3

C. Zheng, Q. Zhu, and D. Sankoff, Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.4, pp.515-522, 2007.
DOI : 10.1109/TCBB.2007.1075

P. Zörnig, Improved optimization modelling for the closest string and related problems, Applied Mathematical Modelling, vol.35, issue.12, pp.5609-5617, 2011.
DOI : 10.1016/j.apm.2011.05.015