R. Boman-e and . Hendrickson-b, A spectral algorithm for seriation and the consecutive ones problem, SIAM Journal on Computing, vol.28, issue.9 10, pp.297-310, 1998.

. B. Abhr-*-13-]-alper, . Bach-b, . Henry-riche-n, and F. Isenberg-t, Weighted graph comparison techniques for brain connectivity analysis, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems CHI '13, ACM, pp.483-492

A. D. Cook-w and R. A. , Chained lin-kernighan for large traveling salesman problems, INFORMS Journal on Computing, vol.15, issue.1, pp.82-92, 2003.

B. , B. R. Boorman-s, and A. P. , An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling, Journal of mathematical psychology, vol.12, issue.5, pp.328-383, 1975.

[. Z. and G. D. Jaakkola-t, Fast optimal leaf ordering for hierarchical clustering, Bioinformatics, vol.17, issue.7 8, pp.22-29, 2001.

B. M. and K. Stahl-s, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, Psychometrika, vol.73, issue.12, pp.503-522, 2008.

. [. Krstajic-m, . Schreck-t, and . A. Keim-d, The News Auditor: Visual Exploration of Clusters of Stories, Proc. EuroVA International Workshop on Visual Analytics Eurographics, pp.61-65, 2012.

B. V. Mrvar-a, Pajek-program for large network analysis, Connections, vol.21, issue.17, pp.47-57, 1998.

]. Bra07 and . U. Brandes, Optimal leaf ordering of complete binary trees, Journ. of Discrete Algorithms, vol.5, issue.5, pp.546-552, 2007.

B. M. Stahl-s, Optimal least-squares unidimensional scaling: Improved branch-and-bound procedures and comparison to dynamic programming, Psychometrika, vol.70, issue.7, pp.253-270, 2005.

B. M. Stahl-s, Branch-and-Bound Applications in Combinatorial Data Analysis, Statistics and Computing, 2006.

C. Y. Church-g, Biclustering of expression data, Ismb, pp.93-103, 2000.

C. E. Mckee-j, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th National Conference ACM '69, ACM, pp.157-172, 1969.

D. J. Petit-j and . Serna-m, A survey of graph layout problems, ACM Comput. Surv, vol.34, issue.3, pp.313-356, 2002.

. N. Edg-*-08-]-elmqvist, G. H. Do-t.-n, H. N. , and F. , ZAME: Interactive Large-Scale Graph Visualization, IEEE Pacific Visualization Symposium, vol.5, pp.215-222, 2008.

[. B. Eisen-m, . T. Spellman-p, . O. Brown-p, and . Botstein-d, Cluster analysis and display of genome-wide expression patterns, Proceedings of the National Academy of Sciences, vol.95, issue.25, pp.25-14863, 1998.
DOI : 10.1073/pnas.95.25.14863

E. P. Wormald-n, Edge crossings in drawings of bipartite graphs, Algorithmica, vol.11, issue.4, pp.379-403, 1994.

]. Fie73 and . M. Fiedler, Algebraic connectivity of graphs, Czechoslovak mathematical journal, vol.23, issue.2, pp.298-305, 1973.

. [. Kwan-e, Effect ordering for data displays, Computational statistics & data analysis, vol.43, issue.4, pp.509-539, 2003.

]. Gel71 and . A. Gelfand, Rapid seriation methods with archaeological applications, Mathematics in the Archaeological and Historical Sciences, pp.186-201, 1971.

. [. Koutsofios-e, . C. North-s, and . Vo-k.-p, A technique for drawing directed graphs, IEEE Trans. Softw. Eng, vol.19, issue.3, pp.214-230, 1993.

G. R. , L. A. Sipiran-i, . Schreck-t, and . Bustos-b, Empirical evaluation of dissimilarity measures for 3d object retrieval with application to multi-feature retrieval, Content- Based Multimedia Indexing (CBMI), 2015 13th International Workshop on, pp.1-6, 2015.

G. N. Poole and J. W. Stockmeyer-p, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM Journal on Numerical Analysis, vol.13, issue.5, pp.236-250, 1976.

H. M. Buchta-c, H. K. Henry, and F. , Infrastructure for seriation, r package version 1.0-14 MatrixExplorer: a dualrepresentation system to explore social networks, IEEE transactions on visualization and computer graphics, vol.12, issue.15, pp.17-677, 2006.

H. L. Golledge-r, Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation, Psychometrika, vol.46, issue.5, pp.429-441, 1981.

H. M. Hornik-k and . Buchta-c, Getting things in order: An introduction to the r package seriation, Journal of Statistical Software, vol.25, issue.10, pp.1-34, 2008.

J. R. Xiang-y and F. D. Dragan-f, Overlapping matrix pattern visualization: A hypergraph approach, Data Mining , 2008. ICDM'08. Eighth IEEE International Conference on, pp.313-322, 2008.

]. Kny01 and . A. Knyazev, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM Journal on Scientific Computing, vol.23, issue.2 8, pp.517-541, 2001.

[. Duarte-a, . Gortázar-f, and . Martí-r, Variable neighborhood search with ejection chains for the antibandwidth problem, Journal of Heuristics, vol.18, issue.5, pp.919-938, 2012.

[. Duarte-a, . Gortázar-f, and . Martí-r, A hybrid metaheuristic for the cyclic antibandwidth problem, Knowledge- Based Systems, vol.54, issue.5, pp.103-113, 2013.

M. Behrisch, Matrix Reordering Methods for Table and Network Visualization Robust singular value decomposition analysis of microarray data, Proceedings of the National Academy of Sciences, vol.100, issue.5, pp.23-13167, 2003.

L. J. Kan-a, Some simple applications of the travelling salesman problem, Operational Research Quarterly, vol.5, pp.717-733, 1975.

O. L. Lo-*-02-]-lazzeroni, Plaid models for gene expression data, Statistica sinica, vol.12, issue.15, pp.61-86, 2002.

L. B. Plaisant-c, F. S. Parr-c, and H. N. , Task taxonomy for graph visualization, Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, pp.1-5, 2006.

L. J. Vornberger-o and W. J. , On some variants of the bandwidth minimization problem, SIAM Journal on Computing, vol.13, issue.13, pp.650-667, 1984.

[. T. , D. S. , and M. J. Schweitzer-p, Identification of Data Structures and Relationships by Matrix Reordering Techniques, p.12, 1969.

]. Mml07a, M. B. Mueller-c, and . Lumsdaine-a, A comparison of vertex ordering algorithms for large graph visualization, Visualization , 2007. APVIS'07. 2007 6th International Asia-Pacific Symposium on, pp.141-148, 2007.

]. Mml07b, M. B. Mueller-c, and . Lumsdaine-a, Interpreting large visual similarity matrices, 6th International Asia-Pacific Symposium on Visualization, pp.149-152, 2007.

M. S. Oliveira-a, Biclustering algorithms for biological data analysis: a survey, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol.1, issue.15, pp.24-45, 2004.

M. E. Siirtola-h, Reordering the reorderable matrix as an algorithmic problem, Theory and Application of Diagrams, pp.453-468, 2000.

M. E. Siirtola-h, The barycenter heuristic and the reorderable matrix, Informatica (Slovenia), vol.29, issue.3, pp.357-364, 2005.

[. T. Schweitzer-p and . W. White-t, Problem decomposition and data reorganization by a clustering technique, Operations Research, vol.20, issue.5, pp.993-1009, 1972.

]. Nie05, . S. Niermann, L. D. Osei-kuffuor, and . Saad-y, Optimizing the ordering of tables with evolutionary computation Matrix reordering using multilevel graph coarsening for ilu preconditioning, The American Statistician SIAM Journal on Scientific Computing, vol.59, issue.1, pp.391-419, 2005.

. A. Preli´cpreli´, . Bleuler-s, W. A. Zimmermann-p, G. W. Bühlmann-p, . Hennig-l et al., A systematic comparison and evaluation of biclustering methods for gene expression data, Bioinformatics, vol.22, issue.9, pp.1122-1129, 2006.
DOI : 10.1093/bioinformatics/btl060

P. C. Dragicevic-p and F. , Revisiting Bertin matrices: New Interactions for Crafting Tabular Visualizations, IEEE Transactions on Visualization and Computer Graphics, vol.5, issue.8, p.20, 2014.

P. P. Matei-o, An efficient metaheuristic approach for solving a class of matrix optimization problems, METAHEURISTICS AND ENGINEERING, vol.5, pp.17-31, 2014.

R. R. Card-s, The table lens: merging graphical and symbolic representations in an interactive focus+ context visualization for tabular information, Proceedings of the SIGCHI conference on Human factors in computing systems, pp.318-322, 1994.

. A. Raspaud, . Schröder-h, . O. S-`-ykora, . Torok-l, and . Vrt-'o-i, Antibandwidth and cyclic antibandwidth of meshes and hypercubes, Discrete Mathematics, vol.309, issue.11, pp.3541-3552, 2009.
DOI : 10.1016/j.disc.2007.12.058

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

R. J. Thompson-t, Seriation and multidimensional scaling: A data analysis approach to scaling asymmetric proximity matrices, Applied psychological measurement, vol.16, issue.5, pp.105-117, 1992.

S. M. Beilken-c and . Berlage-t, Focus: the interactive table for product comparison and selection, Proceedings of the 9th annual ACM symposium on User interface software and technology, pp.41-50, 1996.

S. J. and L. Lumsdaine-a, Boost Graph Library: User Guide and Reference Manual, The. Pearson Education, p.18, 2001.

S. K. Weiner-p, Some improved algorithms for computer solution of the traveling salesman problem, p.15

M. Behrisch, Biclustering algorithms: A survey, Matrix Reordering Methods for Table and Network Visualization Handbook of computational molecular biology, vol.9, issue.8, pp.1-20, 2005.

V. L. Rüden, . Hermanns-m.-a, . Behrisch-m, . Keim-d, and W. F. Mohr-b, Separating the wheat from the chaff: Identifying relevant and similar performance data with visual analytics, Proceedings of the 2nd Workshop on Visual Performance Analysis VPA '15, ACM, pp.1-4

[. C. Mackey-p and M. R. Foote-h, Visual matrix clustering of social networks, pp.88-96, 2013.