A. Amir, L. Gasieniec, and R. Shalom, Improved approximate common interval, Information Processing Letters, vol.103, issue.4, pp.142-149, 2007.
DOI : 10.1016/j.ipl.2007.03.006

S. Böcker, K. Jahn, J. Mixtacki, and J. Stoye, Computation of median gene clusters, RECOMB, pp.331-345, 2008.

C. Chauve, Y. Diekmann, S. Heber, J. Mitxacki, S. Rahmann et al., On common intervals with errors. Forschungsberichte der Technischen Fakultät, Abteilungsinformationstechnik/Uni, pp.2006-2008, 2006.

S. Heber, R. Mayr, and J. Stoye, Common Intervals of Multiple Permutations, Algorithmica, vol.26, issue.2, pp.175-206, 2011.
DOI : 10.1007/s00453-009-9332-1

K. Jahn, Efficient Computation of Approximate Gene Clusters Based on Reference Occurrences, Lecture Notes in Computer Science, vol.6398, pp.264-277, 2011.
DOI : 10.1007/978-3-642-16181-0_22

X. Ling, X. He, and D. Xin, Detecting gene clusters under evolutionary constraint in a large number of genomes, Bioinformatics, vol.25, issue.5, pp.571-577, 2009.
DOI : 10.1093/bioinformatics/btp027

K. Makino and T. Uno, New Algorithms for Enumerating All Maximal Cliques, Algorithm Theory -SWAT 2004, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.705

T. J. Ottosen and J. Vomlel, Honour thy neighbour?clique maintenance in dynamic graphs, proceedings of the Fifth EuropeanWorkshop on Probabilistic Graphical Models, 2010.

R. Overbeek, M. Fonstein, M. D. Souza, G. D. Pusch, and N. Maltsev, The use of gene clusters to infer functional coupling, Proceedings of the National Academy of Sciences, vol.96, issue.6, pp.962896-2901, 1999.
DOI : 10.1073/pnas.96.6.2896

S. Penel, A. Muriel-arigon, J. François-dufayard, A. Sertier, V. Daubin et al., Perrì ere. Databases of homologous gene families for comparative genomics, BMC Bioinformatics, vol.10, 2009.

T. Schmidt and J. Stoye, Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, 2004.
DOI : 10.1007/978-3-540-27801-6_26

V. Stix, Finding All Maximal Cliques in Dynamic Graphs, Computational Optimization and Applications, vol.27, issue.2, pp.173-186, 2004.
DOI : 10.1023/B:COAP.0000008651.28952.b6

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