. Voir-gély, D'autre part, des travaux en cours montrent que plusieurs solutions minimales non isomorphes peuvent exister. Il reste maintenant à caractériser une solution minimale canonique et à obtenir un algorithme produisant cette solution, 2018.

R. Bandelt, H. , P. Forster, and A. Röhl, Median-joining networks for inferring intraspecific phylogenies, Molecular biology and evolution, vol.16, issue.1, pp.37-48, 1999.

H. Bandelt, J. Et, and . Hedlíková, Median algebras, Discrete mathematics, vol.45, issue.1, pp.1-30, 1983.

M. Barbut and B. Monjardet, Ordre et classification, paris, hachette, 1970.

G. Birkhoff, On the combination of subalgebras, In Mathematical Proceedings of the Cambridge Philosophical Society, vol.29, pp.441-464, 1933.

G. Birkhoff, Rings of sets, Duke Math. J, vol.3, issue.3, pp.443-454, 1937.

G. Birkhoff, Lattice Theory, 1967.

P. Buneman, The recovery of trees from measures of dissimilarity. Mathematics in the archaeological and historical sciences, 1971.

N. Caspard, B. Leclerc, and B. Monjardet, Finite ordered sets : concepts, results and uses, Number, vol.144, 2012.
URL : https://hal.archives-ouvertes.fr/halshs-00800193

B. Ganter and . Et-r.-wille, Formal Concept Analysis : Mathematical Foundations, 1999.

A. Gély, M. Couceiro, Y. Namir, and A. Napoli, Contribution à l'étude de la distributivité d'un treillis de concepts, Extraction et Gestion des Connaissances, EGC 2018, pp.107-118, 2018.

A. Gély, M. Couceiro, and A. Napoli, Steps towards achieving distributivity in formal concept analysis, Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, pp.105-116, 2018.

U. Priss, Concept lattices and median networks, CLA, pp.351-354, 2012.

U. Priss, Representing median networks with concept lattices, ICCS, pp.311-321, 2013.

, Summary Philogenetic classification uses phylogeny data to classify species. The more traditionnal models are phylogenetic trees. Nevertheless, trees miss some complexity of evolution, and so, several trees should be used. Median graphs permit to encode all these trees in a unique structure