J. Akiyama, G. Exoo, and F. Harary, Covering and packing in graphs IV: Linear arboricity, Networks, vol.39, issue.1, pp.69-72, 1981.
DOI : 10.1002/net.3230110108

J. Alber, J. Gramm, J. Guo, and R. Niedermeier, Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time, Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM), pp.99-114, 2002.
DOI : 10.1007/3-540-45452-7_10

N. Alon, The linear arboricity of graphs, Israel Journal of Mathematics, vol.3, issue.3, pp.311-325, 1988.
DOI : 10.1007/BF02783300

N. Alon and J. H. Spencer, The probabilistic method, 1992.

P. Berman and M. Karpinski, On Some Tighter Inapproximability Results (Extended Abstract), Proc. 26th International Colloquium on Automata, Languages and Programming (ICALP), pp.200-209, 1999.
DOI : 10.1007/3-540-48523-6_17

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

G. Brevier, R. Rizzi, and S. Vialette, Pattern Matching in Protein-Protein Interaction Graphs, Proc. 16th Fundamentals of Computation Theory, 16th International Symposium (FCT), pp.137-148, 2007.
DOI : 10.1007/978-3-540-74240-1_13
URL : https://hal.archives-ouvertes.fr/hal-00199009

P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and Finite Sets (Colloq, Coll, pp.609-627, 1973.

I. Fagnot, G. Lelandais, and S. Vialette, Bounded list injective homomorphism for comparative analysis of protein???protein interaction graphs, Journal of Discrete Algorithms, vol.6, issue.2, pp.178-191, 2008.
DOI : 10.1016/j.jda.2007.06.002
URL : https://hal.archives-ouvertes.fr/hal-00619701

G. Fertin, R. Rizzi, and S. Vialette, Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs, Proc. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.328-339, 2005.
DOI : 10.1007/11549345_29
URL : https://hal.archives-ouvertes.fr/hal-00620292

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

A. C. Gavin and M. Boshe, Functional organization of the yeast proteome by systematic analysis of protein complexes, Nature, vol.415, issue.6868, pp.141-147, 2002.
DOI : 10.1038/415141a

J. Gramm, J. Guo, and R. Niedermeier, Pattern matching for arc-annotated sequences, ACM Transactions on Algorithms, vol.2, issue.1, pp.44-65, 2006.
DOI : 10.1145/1125994.1125997

Y. Ho and A. Gruhler, Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry, Nature, vol.415, issue.6868, pp.180-183, 2002.
DOI : 10.1038/415180a

M. Kalaev, V. Bafna, and R. Sharan, Fast and accurate alignment of multiple protein networks, Proc. 12th Annual International Conference on Computational Molecular Biology (RECOMB), 2008.

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

S. Micali, V. V. Vazirani, and O. An, |V ||E|) algorithm for finding maximum matching in general graphs, Proc. 21st Annual Symposium on Foundation of Computer Science (FOCS), pp.17-27, 1980.

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X
URL : http://doi.org/10.1016/0022-0000(91)90023-x

M. Pellegrini, E. M. Marcotte, M. J. Thompson, D. Eisenberg, and T. O. Yeates, Assigning protein functions by comparative genome analysis: Protein phylogenetic profiles, Proceedings of the National Academy of Sciences, vol.96, issue.8, pp.4285-4288, 1999.
DOI : 10.1073/pnas.96.8.4285
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC16324

J. B. Pereira-leal, A. J. Enright, and C. A. , Detection of functional modules from protein interaction networks, Proteins: Structure, Function, and Bioinformatics, vol.147, issue.1, pp.49-57, 2004.
DOI : 10.1002/prot.10505

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

B. Titz, M. Schlesner, and P. Uetz, What do we learn from high-throughput protein interaction data?, Expert Review of Proteomics, vol.1, issue.1, pp.111-121, 2004.
DOI : 10.1586/14789450.1.1.111

P. Uetz and L. Giot, A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisae, Nature, vol.403, issue.6770, pp.623-627, 2000.

Q. Yang and S. Sze, Path Matching and Graph Matching in Biological Networks, Journal of Computational Biology, vol.14, issue.1, pp.56-67, 2007.
DOI : 10.1089/cmb.2006.0076