K. Atteson, The performance of neighbor-­?joining methods of phylogenetic reconstruction, Algorithmica, pp.251-278, 1999.

M. Bordewich, O. Gascuel, K. T. Huber, and A. V. Moulton, Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.1, pp.110-117, 2009.
DOI : 10.1109/TCBB.2008.37
URL : https://hal.archives-ouvertes.fr/lirmm-00324146

M. Bordewich-and-r and . Mihaescu, Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, issue.3, pp.576-583, 2013.
DOI : 10.1109/TCBB.2013.39

D. G. Brown and . Truszkowski, Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing, Algorithms in Bioinformatics, pp.14-29, 2012.
DOI : 10.1007/978-3-642-33122-0_2

W. Dai, Y. Xu, and A. B. Zhu, On the edge <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mo>???</mml:mo></mml:mrow></mml:msub></mml:math> radius of Saitou and Nei's method for phylogenetic reconstruction, Theoretical Computer Science, vol.369, issue.1-3, pp.448-455, 2006.
DOI : 10.1016/j.tcs.2006.08.044

R. Desper-and-o and . Gascuel, Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle, Journal of Computational Biology, vol.9, issue.5, pp.687-706, 2002.
DOI : 10.1089/106652702761034136

J. Evans, L. Sheneman, and A. J. Foster, Relaxed Neighbor Joining: A Fast Distance-Based Phylogenetic Tree Construction Method, Journal of Molecular Evolution, vol.64, issue.6, pp.785-792, 2006.
DOI : 10.1007/s00239-005-0176-2

O. A. Gascuel and . Mckenzie, Performance Analysis of Hierarchical Clustering Algorithms, Journal of Classification, vol.21, issue.1, pp.3-18, 2004.
DOI : 10.1007/s00357-004-0003-2
URL : https://hal.archives-ouvertes.fr/lirmm-00108570

O. Gascuel-and-m and . Steel, Neighbor-Joining Revealed, Molecular Biology and Evolution, vol.23, issue.11, 1997.
DOI : 10.1093/molbev/msl072

I. S. Gronau and . Moran, Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances, Journal of Computational Biology, vol.14, issue.1, pp.1-15, 2007.
DOI : 10.1089/cmb.2006.0115

J. Hein, An optimal algorithm to reconstruct trees from additive distance data, Bulletin of Mathematical Biology, vol.64, issue.5, pp.597-603, 1989.
DOI : 10.1007/BF02459968

F. Pardi, S. Guillemot, and A. O. Gascuel, Robustness of Phylogenetic Inference Based on Minimum Evolution, Bulletin of Mathematical Biology, vol.67, issue.2, pp.1820-1839, 2010.
DOI : 10.1007/s11538-010-9510-y
URL : https://hal.archives-ouvertes.fr/lirmm-00511779

Y. Pauplin, Direct Calculation of a Tree Length Using a Distance Matrix, Journal of Molecular Evolution, vol.51, issue.1, pp.41-47, 2000.
DOI : 10.1007/s002390010065

M. N. Price, P. S. Dehal, and A. A. Arkin, FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix, Molecular Biology and Evolution, vol.26, issue.7, pp.1641-1650, 2009.
DOI : 10.1093/molbev/msp077

N. Saitou-and-m and . Nei, The Neighbor-­?joining Method: A New Method for Reconstructing Phylogenetic Trees, Molecular Biology and Evolution, vol.4, pp.406-425, 1987.

T. Shigezumi, Robustness of Greedy Type Minimum Evolution Algorithms, Computational Science? ICCS, pp.815-821, 2006.
DOI : 10.1007/11758525_109

M. Simonsen, T. Mailund, and C. N. Pedersen, Inference of Large Phylogenies Using Neighbour-Joining, Biomedical Engineering Systems and Technologies, Communications in Computer and Information Science, pp.334-344, 2011.
DOI : 10.1007/978-3-642-18472-7_26

S. Willson, Minimum evolution using ordinary least-squares is less robust than neighbor-joining, Bulletin of Mathematical Biology, vol.67, issue.2, pp.261-279, 2005.
DOI : 10.1016/j.bulm.2004.07.007

K. Zarestkii, Reconstructing a tree from the distances between its leaves, Russian) Uspehi Mathematicheskikh Nauk, pp.90-92, 1965.

O. Gascuel and M. Steel, A 'stochastic safety radius' for distance-­?based tree reconstruction. Algorithmica, DOI 10, pp.453-468, 1007.
URL : https://hal.archives-ouvertes.fr/lirmm-01346675