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

N. Betzler, M. R. Fellows, C. Komusiewicz, and R. Niedermeier, Parameterized Algorithms and Hardness Results for Some Graph Motif Problems, Proc. 19th Annual Symposium on Combinatorial Pattern Matching (CPM), 2008.
DOI : 10.1007/978-3-540-69068-9_6

R. Dondi, G. Fertin, and S. Vialette, WEAK PATTERN MATCHING IN COLORED GRAPHS: MINIMIZING THE NUMBER OF CONNECTED COMPONENTS, Theoretical Computer Science, pp.27-38, 2007.
DOI : 10.1142/9789812770998_0007
URL : https://hal.archives-ouvertes.fr/hal-00417910

M. Fellows, G. Fertin, D. Hermelin, and S. Vialette, Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs, Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP), pp.340-351, 2007.
DOI : 10.1007/978-3-540-73420-8_31
URL : https://hal.archives-ouvertes.fr/hal-00417928

J. Hein, T. Jiang, L. Wang, and K. Zhang, On the complexity of comparing evolutionary trees, Discrete Applied Mathematics, vol.71, issue.1-3, pp.153-169, 1996.
DOI : 10.1016/S0166-218X(96)00062-5

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

D. Karger, R. Motwani, and G. D. Ramkumar, On approximating the longest path in a graph, SIAM Journal on Computing, vol.24, pp.1122-1139, 1995.

B. P. Kelley, R. Sharan, R. M. Karp, T. Sittler, D. E. Root et al., Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proceedings of the National Academy of Sciences, vol.100, issue.20, pp.11394-11399, 2003.
DOI : 10.1073/pnas.1534710100

M. Koyutürk, A. Grama, and W. Szpankowski, Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution, Proc. 9th Annual International Conference on Research in Computational Molecular Biology, pp.48-65, 2005.
DOI : 10.1007/11415770_4

V. Lacroix, C. G. Fernandes, and M. Sagot, Motif Search in Graphs: Application to Metabolic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.360-368, 2006.
DOI : 10.1109/TCBB.2006.55
URL : https://hal.archives-ouvertes.fr/hal-00427984

R. Niedermeier, Invitation to fixed parameter algorithms, Lecture Series in Mathematics and Its Applications, 2006.

J. Scott, T. Ideker, R. M. Karp, 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.
DOI : 10.1089/cmb.2006.13.133

R. Sharan, T. Ideker, B. Kelley, R. Shamir, and R. M. Karp, Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data, Proc. 8th annual international conference on Computational molecular biology (RECOMB), pp.282-289, 2004.

R. Sharan, S. Suthram, R. M. Kelley, T. Kuhn, S. Mccuine et al., Conserved patterns of protein interaction in multiple species, Proc. Natl Acad. Sci. USA, 1974.
DOI : 10.1073/pnas.0409522102