K. R. Abrahamson and M. R. Fellows, Finite automata, bounded treewidth and well-quasiordering, Graph Structure Theory, pp.539-564, 1993.
DOI : 10.1090/conm/147/01199

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, Asynchronous Pattern Matching, Proceedings of the 17th annual symposium on Combinatorial Pattern Matching (CPM), pp.1-10, 2006.
DOI : 10.1007/11780441_1

A. Amir, A. Apostolico, G. M. Landau, and G. Satta, Efficient text fingerprinting via Parikh mapping, Journal of Discrete Algorithms, vol.1, issue.5-6, pp.409-421, 2003.
DOI : 10.1016/S1570-8667(03)00035-2
URL : http://doi.org/10.1016/s1570-8667(03)00035-2

A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky et al., Pattern matching with address errors, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1221-1229, 2006.
DOI : 10.1145/1109557.1109692

S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability ??? A survey, BIT, vol.2, issue.1, pp.2-23, 1985.
DOI : 10.1007/BF01934985

S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics, vol.23, issue.1, pp.11-24, 1989.
DOI : 10.1016/0166-218X(89)90031-0

H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, vol.11, pp.1-23, 1993.

H. L. Bodlaender and L. E. De-fluiter, Intervalizing k-colored graphs, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), pp.87-98, 1995.
DOI : 10.1007/3-540-60084-1_65
URL : http://dspace.library.uu.nl:8080/handle/1874/21990

H. L. Bodlaender, M. R. Fellows, M. A. Langston, M. A. Ragan, F. A. Rosamond et al., Kernelization for convex recoloring, Proceedings of the 2nd workshop on Algorithms and Complexity in Durham (ACiD), pp.23-35, 2006.
DOI : 10.1007/978-3-540-73545-8_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.6341

H. L. Bodlaender, M. R. Fellows, and T. Warnow, Two strikes against perfect phylogeny, Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP), pp.273-283, 1992.
DOI : 10.1007/3-540-55719-9_80
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7239

B. Chor, M. R. Fellows, M. A. Ragan, F. A. Rosamond, and S. Snir, Connected Coloring Completion for General Graphs: Algorithms and Complexity, 2007.
DOI : 10.1007/978-3-540-73545-8_10

D. G. Corneil and J. M. , -Trees, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.4, pp.535-543, 1987.
DOI : 10.1137/0608044
URL : https://hal.archives-ouvertes.fr/hal-01274081

Y. Deville, D. Gilbert, J. Van-helden, and S. J. Wodak, An overview of data models for the analysis of biochemical pathways, Briefings in Bioinformatics, vol.4, issue.3, pp.246-259, 2003.
DOI : 10.1093/bib/4.3.246

R. Downey and M. Fellows, Parameterized Complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

M. R. Fellows, M. T. Hallett, and H. T. Wareham, DNA physical mapping: Three ways difficult, Proceedings of the 1st annual European Symposium on Algorithms (ESA), pp.157-168, 1993.
DOI : 10.1007/3-540-57273-2_52

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

M. Golumbic, H. Kaplan, and R. Shamir, On the Complexity of DNA Physical Mapping, Advances in Applied Mathematics, vol.15, issue.3, pp.251-261, 1994.
DOI : 10.1006/aama.1994.1009

T. Ideker, R. M. Karp, J. Scott, and R. Sharan, Efficient algorithms for detecting signaling pathways in protein interaction networks, Journal of Computational Biology, vol.13, issue.2, pp.133-144, 2006.

V. Lacroix, C. G. Fernandes, and M. Sagot, Reaction Motifs in Metabolic Networks, Proceedings of the 5th international Workshop on Algorithms in BioInformatics (WABI), pp.178-191, 2005.
DOI : 10.1007/11557067_15
URL : https://hal.archives-ouvertes.fr/hal-00427769

F. R. Mcmorris, T. J. Warnow, and T. Wimer, Triangulating Vertex-Colored Graphs, SIAM Journal on Discrete Mathematics, vol.7, issue.2, pp.296-306, 1994.
DOI : 10.1137/S0895480192229273

S. Moran and S. Snir, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, Proceedings of the 9th international Workshop on Algorithms and Data Structures (WADS), pp.218-232, 2005.

J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, Proceedings of the 25th annual ACM Symposium on Theory Of Computing (STOC), pp.213-223, 1990.
DOI : 10.1137/0222053
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5110

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1999.1919