R. Agrawal, T. Imieli?ski, and A. Swami, Mining association rules between sets of items in large databases, SIGMOD'93, pp.207-216, 1993.

F. Alizadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser, Physical mapping of chromosomes: A combinatorial problem in molecular biology, Algorithmica, vol.83, issue.1, pp.52-76, 1995.
DOI : 10.1007/BF01188581

J. Atkins, E. Boman, and B. Hendrickson, A Spectral Algorithm for Seriation and the Consecutive Ones Problem, SIAM Journal on Computing, vol.28, issue.1, pp.297-310, 1999.
DOI : 10.1137/S0097539795285771

C. Aykanat, A. Pinar, and U. Çatalyürek, Permuting Sparse Rectangular Matrices into Block-Diagonal Form, SIAM Journal on Scientific Computing, vol.25, issue.6, pp.1860-1879, 2004.
DOI : 10.1137/S1064827502401953

R. Baeza-yates and B. Ribeiro-neto, Modern Information Retrieval, 1999.

A. Banerjee, C. Krumpelman, J. Ghosh, S. Basu, and R. Mooney, Model-based overlapping clustering, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.532-537, 2005.
DOI : 10.1145/1081870.1081932

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

Z. Bar-yossef, I. Guy, R. Lempel, Y. S. Maarek, and V. Soroka, Cluster ranking with an application to mining mailbox networks, Knowledge and Information Systems, vol.15, issue.12, pp.101-139, 2008.
DOI : 10.1007/s10115-007-0096-0

J. Bertin, Graphics and graphic information processing, pp.62-65, 1999.
DOI : 10.1515/9783110854688

K. S. Booth, PQ-tree algorithms, 1975.

P. Burzyn, F. Bonomo, and G. Durán, NP-completeness results for edge modification problems, Discrete Applied Mathematics, vol.154, issue.13, pp.1824-1844, 2006.
DOI : 10.1016/j.dam.2006.03.031

K. Chen and L. Liu, ???Best K???: critical clustering structures in categorical datasets, Knowledge and Information Systems, vol.9, issue.3, pp.1-33, 2009.
DOI : 10.1007/s10115-008-0159-x

T. Cormen, C. Leiserson, and R. Rivest, Introduction to algorithms, 1990.

E. Cuthill and J. Mckee, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th national conference on -, pp.157-172, 1969.
DOI : 10.1145/800195.805928

S. Embleton and E. Wheeler, Computerized Dialect Atlas of Finnish: Dealing with Ambiguity, Journal of Quantitative Linguistics, vol.7, issue.3, pp.227-231, 2000.
DOI : 10.1076/jqul.

M. Fortelius, Neogene of the old world database of fossil mammals (NOW), 2008.

G. Garriga, E. Junttila, and H. Mannila, Banded structure in binary matrices, KDD'08, pp.292-300, 2008.
DOI : 10.1007/s10115-010-0319-7

URL : https://hal.archives-ouvertes.fr/hal-00658836

M. Girvan and M. Newman, Community structure in social and biological networks, Proc. National Academy of Sciences USA, pp.997821-7826, 2002.
DOI : 10.1073/pnas.122653799

S. Kirkpatrick, C. Gelatt, and M. Vecchi, Optimization by simulated annealing, Science, Number, vol.4598, issue.4598, pp.671-680, 1983.

D. Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.

I. Lin and D. B. West, Interval digraphs that are indifference digraphs, Graph theory, Combinatorics, and Algorithms, pp.751-765, 1992.

S. C. Madeira and A. L. Oliveira, Biclustering algorithms for biological data analysis: a survey, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.1, issue.1, pp.24-45, 2004.
DOI : 10.1109/TCBB.2004.2

E. Mäkinen and H. Siirtola, Reordering the Reorderable Matrix as an Algorithmic Problem, Diagrams '00: Proceedings of the First International Conference on Theory and Application of Diagrams, pp.453-467, 2000.
DOI : 10.1007/3-540-44590-0_37

H. Mannila and E. Terzi, Nestedness and segmented nestedness, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '07, pp.480-489, 2007.
DOI : 10.1145/1281192.1281245

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. M. Mcconnell, A certifying algorithm for the consecutive-ones property, SODA'04, pp.768-777, 2004.

G. Moise, A. Zimek, P. Kröger, H. Kriegel, and J. Sander, Subspace and projected clustering: experimental evaluation and analysis, Knowledge and Information Systems, vol.17, issue.2, pp.299-326, 2009.
DOI : 10.1007/s10115-009-0226-y

S. Myllykangas, J. Himberg, T. Böhling, B. Nagy, J. Hollmén et al., DNA copy number amplification profiling of human neoplasms, Oncogene, vol.39, issue.55, pp.7324-7332, 2006.
DOI : 10.1038/sj.onc.1209717

C. H. Papadimitriou, Die NP-Geschlossenheit des Problems der minimalen Bandbreite, Computing, vol.11, issue.3, pp.263-270, 1976.
DOI : 10.1007/BF02280884

L. Parsons, E. Haque, and H. Liu, Subspace clustering for high dimensional data, ACM SIGKDD Explorations Newsletter, vol.6, issue.1, pp.90-105, 2004.
DOI : 10.1145/1007730.1007731

K. Puolamäki, M. Fortelius, and H. Mannila, Seriation in Paleontological Data Using Markov Chain Monte Carlo Methods, PLoS Computational Biology, vol.91, issue.2, 2006.
DOI : 0162-1459(1996)091[1716:MHDEFF]2.0.CO;2

F. S. Roberts, Indifference graphs, Proof Techniques in Graph Theory, pp.139-146, 1969.

R. Rosen, Matrix bandwidth minimization, Proceedings of the 1968 23rd ACM national conference on -, pp.585-595, 1968.
DOI : 10.1145/800186.810622

M. Sen and B. K. Sanyal, Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders, SIAM Journal on Discrete Mathematics, vol.7, issue.2, pp.157-165, 1994.
DOI : 10.1137/S0895480190177145

K. Sugiyama, S. Tagawa, and M. Toda, Methods for Visual Understanding of Hierarchical System Structures, IEEE Transactions on Systems, Man, and Cybernetics, vol.11, issue.2, pp.109-125, 1981.
DOI : 10.1109/TSMC.1981.4308636

P. Tian, J. Ma, and D. Zhang, Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism, European Journal of Operational Research, vol.118, issue.1, pp.81-94, 1999.
DOI : 10.1016/S0377-2217(98)00308-7

A. Tucker, A structure theorem for the consecutive 1's property, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.153-162, 1972.
DOI : 10.1016/0095-8956(72)90019-6