M. Béal, A. Bergeron, S. Corteel, and M. Raffinot, An algorithmic view of gene teams, Theoretical Computer Science, vol.320, issue.2-3, pp.395-418, 2004.
DOI : 10.1016/j.tcs.2004.02.036

S. Bérard, A. Bergeron, and C. Chauve, Conserved structures in evolution scenarios, 2004.

A. Bergeron, S. Heber, and J. Stoye, Common intervals and sorting by reversals: a marriage of necessity, ECCB02, pp.54-63, 2002.
DOI : 10.1093/bioinformatics/18.suppl_2.S54

A. Bergeron and J. Stoye, On the similarity of sets of permutations and its applications to genome comparison, COCOON03, pp.68-79, 2003.

K. P. Bogart, P. C. Fishburn, G. Isaak, and L. Langley, Proper and unit tolerance graphs, Discrete Applied Mathematics, vol.60, issue.1-3, pp.99-117, 1995.
DOI : 10.1016/0166-218X(94)00044-E
URL : http://doi.org/10.1016/0166-218x(94)00044-e

C. Capelle, Block decomposition of inheritance hierarchies. WG97, pp.118-131, 1997.

C. Capelle, Décomposition de Graphes et Permutations Factorisantes, 1997.

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981.
DOI : 10.1016/0012-365X(81)90138-2
URL : http://doi.org/10.1016/0012-365x(81)90138-2

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in algebra and programming?CAAP 94, pp.68-84, 1994.
DOI : 10.1007/BFb0017474

D. D. Cowan, L. O. James, and R. G. Stanton, Graph decomposition for undirected graphs, 3rd S-E Conf. Combinatorics, Graph Theory and Computing, pp.281-290, 1972.

E. Dahlhaus, Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition, Journal of Algorithms, vol.36, issue.2, pp.205-240, 2000.
DOI : 10.1006/jagm.2000.1090

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00072855

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational geometry, 1991.

S. Felsner, Tolerance graphs, and orders, Journal of Graph Theory, vol.28, issue.3, pp.129-140, 1998.
DOI : 10.1002/(SICI)1097-0118(199807)28:3<129::AID-JGT2>3.0.CO;2-M
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4913

M. Figeac and J. Varré, Sorting by Reversals with Common Intervals, Lecture Notes in Bioinformatics, vol.3240, pp.26-37, 2004.
DOI : 10.1007/978-3-540-30219-3_3

M. Habib, M. Huchard, and J. P. Spinrad, A linear algorithm to decompose inheritance graphs into modules, Algorithmica, vol.11, issue.6, pp.573-591, 1995.
DOI : 10.1007/BF01189070

M. Habib, F. De-montgolfier, and C. Paul, A simple linear-time modular decomposition algorithm, LNCS, vol.04, issue.3111, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108788

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

S. Heber and J. Stoye, Finding All Common Intervals of k Permutations, LNCS, vol.04, pp.207-218, 2001.
DOI : 10.1007/3-540-48194-X_19

W. Hsu and T. Ma, Substitution decomposition on chordal graphs and applications, Proceedings of the 2nd ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, number 557 in LNCS, pp.52-60, 1991.
DOI : 10.1007/3-540-54945-5_49

G. M. Landau, L. Parida, and O. Weimann, Gene proximity analysis across whole genomes via PQ Trees, 2004.

R. M. Mcconnell and F. De-montgolfier, Algebraic Operations on PQ Trees and Modular Decomposition Trees, 2005.
DOI : 10.1007/11604686_37
URL : https://hal.archives-ouvertes.fr/hal-00159590

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

R. H. Möhring and F. J. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Annals of Discrete Mathematics, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

F. De-montgolfier, Décomposition modulaire des graphes. Théorie, extensions et algorithmes, 2003.

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014

D. J. Welsh, Matroids: Fundamental concepts, Handbook of Combinatorics, pp.481-526, 1995.