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

A. Bergeron, S. Corteel, and M. Raffinot, The Algorithmic of Gene Teams, Workshop on Algorithms in Bioinformatics (WABI), number 2452 in Lecture Notes in Computer Science, pp.464-476, 2002.
DOI : 10.1007/3-540-45784-4_36

M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, pp.36-44, 1973.
DOI : 10.1016/S0022-0000(73)80033-9
URL : http://doi.org/10.1016/s0022-0000(73)80033-9

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook et al., Maintenance of a minimum spanning forest in a dynamic plane graph, Journal of Algorithms, vol.13, issue.1, pp.33-54, 1992.
DOI : 10.1016/0196-6774(92)90004-V

A. Gai, M. Habib, C. Paul, and M. Raffinot, Identifying common connected components of graphs, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269551

M. Habib, F. De-montgolfier, and C. Paul, A simple linear-time modular decomposition algorithm, Scandinavian Workshop on Algorithm Theory-SWAT04, number 3111 in Lecture Notes in Computer Science 9th Scandinavian Workshop on Algorithm Theory, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108788

M. Habib, C. Paul, and M. Raffinot, Common connected components of interval graphs, Combinatorial Pattern Matching -CPM04, number 3109 in Lecture Notes in Computer Science 15th Annual Combinatorial Pattern Matching Symposium, pp.347-358, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00269548

J. Holm, K. De-lichtenberg, and M. Thorup, Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2?edge, and biconnectivity, 30th annu ACM Sympos. Theory Comput, pp.79-89, 1998.
DOI : 10.1145/502090.502095

R. J. Lipton and R. E. Tarjan, Applications of a Planar Separator Theorem, SIAM Journal on Computing, vol.9, issue.3, pp.615-627, 1980.
DOI : 10.1137/0209046

R. M. Mcconnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.536-545, 1994.

K. Mehlhorn, Data Structures and Efficient Algorithms, EATCS Monographs, 1984.

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