R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson et al., On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics), SIAM Journal on Computing, vol.28, issue.3, pp.1073-1085, 1999.
DOI : 10.1137/S0097539795296334

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4

J. E. Atkins, E. G. 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, 1998.
DOI : 10.1137/S0097539795285771

M. B?-adoiu, A. Gupta, K. Dhamdhere, Y. Rabinovich, H. Räcke et al., Approximation algorithms for low-distortion embeddings into low-dimensional spaces, SODA, 2005.

G. Caraux and S. Pinloche, PermutMatrix: a graphical environment to arrange gene expression profiles in optimal linear order, Bioinformatics, vol.21, issue.7, pp.1280-1281, 2005.
DOI : 10.1093/bioinformatics/bti141

URL : https://hal.archives-ouvertes.fr/lirmm-00105307

V. Chepoi and B. Fichet, l???-Approximation via Subdominants, Journal of Mathematical Psychology, vol.44, issue.4, pp.600-616, 2000.
DOI : 10.1006/jmps.1999.1270

V. Chepoi, B. Fichet, and M. Seston, Seriation in the Presence of Errors: NP-Hardness of l ??? -Fitting Robinson Structures to Dissimilarity Matrices, Journal of Classification, vol.16, issue.3
DOI : 10.1007/s00357-009-9041-0

V. Chepoi and M. Seston, Seriation in the presence of errors: an approximation algorithm for fitting Robinson structures to dissimilarity matrices (submitted)

B. Chor and M. Sudan, A Geometric Approach to Betweenness, SIAM Journal on Discrete Mathematics, vol.11, issue.4, pp.511-523, 1998.
DOI : 10.1137/S0895480195296221

E. Diday, Orders and overlapping clusters by pyramids, Multidim. Data Analysis, pp.201-234, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00075822

C. Durand and B. Fichet, One-to-one correspondences in pyramidal representation: a unified approach, In Classification and Related Methods of Data Analysis, pp.85-90, 1988.

M. Farach, S. Kannan, and E. T. Warnow, A robust model for finding optimal evolutionary trees, Algorithmica, pp.13-155, 1995.

M. Hahsler, K. Hornik, and C. Buchta, Getting things in order: an introduction to the R package seriation, J. Statistical Software, pp.25-26, 2008.

J. Hstad, L. Ivansson, and J. Lagergren, Fitting points on the real line and its application to RH mapping, ESA 1998 and J. Algorithms, pp.49-91, 2003.

L. J. Hubert, SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON-METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES, British Journal of Mathematical and Statistical Psychology, vol.27, issue.2, pp.133-153, 1974.
DOI : 10.1111/j.2044-8317.1974.tb00534.x

D. S. Johnson, The NP-completeness column: An ongoing guide, Journal of Algorithms, vol.3, issue.2, pp.182-195, 1982.
DOI : 10.1016/0196-6774(82)90018-9

D. G. Kendall, Seriation from abundance matrices Mathematics in the Archaeological and Historical Sciences, pp.215-252, 1971.

W. S. Robinson, A Method for Chronologically Ordering Archaeological Deposits, American Antiquity, vol.16, issue.04, pp.293-301, 1951.
DOI : 10.2307/276978