M. Croisement-de, 105 6.2.3 Construction de l'arbre fils

J. Aldrich and .. R. , R.A. Fisher and the making of maximum likelihood 1912-1922, Statistical Science, vol.12, issue.3, pp.162-176, 1997.
DOI : 10.1214/ss/1030037906

L. Benjamin, M. Allen, and . Steel, Subtree transfer operations and their induced metrics on evolutionary trees, Annals of Combinatorics, vol.5, issue.1, pp.1-15, 2001.

A. Andreatta and C. C. Ribeiro, Heuristics for the phylogeny problem, Journal of Heuristics, vol.8, issue.4, pp.429-447, 2002.
DOI : 10.1023/A:1015439913121

. Aristote, Des Parties des Animaux. IVe s. av, J.-C

D. Barker, LVB: parsimony and simulated annealing in the search for phylogenetic trees, Bioinformatics, vol.20, issue.2, pp.274-275, 2004.
DOI : 10.1093/bioinformatics/btg402

O. Bastert, D. Rockmore, P. F. Stadler, and G. Tinhofer, Landscapes on spaces of trees, Applied Mathematics and Computation, vol.131, issue.2-3, pp.439-459, 2002.
DOI : 10.1016/S0096-3003(01)00164-3

R. Bernard and . Baum, Combining trees as a way of combining data for phylogenetic inference , and the desirability of combining gene trees, Taxon, vol.41, pp.3-10, 1958.

C. Berge, Theorie des Graphes et ses Applications, Dunod, 1958.

R. P. Olaf and . Bininda-emonds, Properties of matrix representation with parsimony analyses, Systematic Biology, vol.47, issue.3, pp.497-508, 1998.

R. P. Olaf and . Bininda-emonds, The (super)tree of life: procedures, problems, and prospects, EFÉRENCESEF´EFÉRENCES BIBLIOGRAPHIQUES [Bininda-Emonds, pp.265-289, 2002.

R. P. Olaf and . Bininda-emonds, The evolution of supertrees, Trends in Ecology and Evolution, vol.19, issue.6, pp.315-322, 2004.

E. Bonomi and J. Lutton, -City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm, SIAM Review, vol.26, issue.4, pp.551-568, 1984.
DOI : 10.1137/1026105
URL : https://hal.archives-ouvertes.fr/inria-00440395

M. Bordewich and C. Semple, On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance, Annals of Combinatorics, vol.8, issue.4, pp.409-423, 2004.
DOI : 10.1007/s00026-004-0229-z

D. Bryantbush, The splits in the neighborhood of a tree, Annals of Combinatorics, vol.8, pp.1-11, 1999.

. Fitch, Predicting the evolution of human influenza a, Science, vol.286, pp.1921-1925, 1999.

H. Joseph, R. R. Camin, and . Sokal, A method for deducing branching sequences in phylogeny, Evolution, vol.19, pp.311-326, 1965.

M. Carrington and A. , Molecular Epidemiology, 2001.

L. Luca, A. W. Cavalli-sforza, and . Edwards, Phylogenetic analysis models and estimation procedures, American Journal of Human Genetics, vol.19, pp.233-257, 1967.

J. A. Cavender, Taxonomy with confidence, Mathematical Biosciences, vol.40, issue.3-4, pp.271-280, 1857.
DOI : 10.1016/0025-5564(78)90089-5

A. Cayley, On the Theory of the Analytical Forms called Trees, Philosophy Magazine, vol.13, pp.172-176, 1857.
DOI : 10.1017/CBO9780511703690.046

C. Vladimír-cer?, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol.21, issue.1, pp.41-51, 1985.
DOI : 10.1007/BF00940812

I. Charon and O. Hudry, The noising method: a new method for combinatorial optimization, Operations Research Letters, vol.14, issue.3, pp.133-137, 1993.
DOI : 10.1016/0167-6377(93)90023-A

I. Charon and O. Hudry, The Noising Methods: A Survey, Essays and Surveys in Metaheuristics, pp.245-261, 1993.
DOI : 10.1007/978-1-4615-1507-4_12

M. Clark, B. S. Hedrén, R. K. Gaut, K. Jansen, C. F. Kim et al., Phylogenetics of seed plants: an analysis of nucleotide sequences from the plastid gene rbcL, Annals of the Missouri Botanical Gardens, pp.528-580, 1993.

F. S. Collins, M. Morgan, and A. Patrinos, The Human Genome Project: Lessons from Large-Scale Biology, Science, vol.300, issue.5617, pp.286-290, 2003.
DOI : 10.1126/science.1084564

C. B. Congdon and K. J. Septor, Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., pp.320-326, 2003.
DOI : 10.1109/CEC.2003.1299592

C. B. Congdon, Gaphyl: An evolutionary algorithms approach for the study of natural evolution, GECCO '02: Proceedings of the Genetic and Evolutionary Computation Conference, pp.1057-1064, 2002.

C. Cotta and P. Moscato, Inferring Phylogenetic Trees Using Evolutionary Algorithms
DOI : 10.1007/3-540-45712-7_69

. Schwefel, Parallel Problem Solving From Nature VII, volume 2439 of Lecture Notes in Computer Science, pp.720-729, 1812.

G. Cuvier, Recherches sur les ossements fossiles de quadrupèdes, p.1812
DOI : 10.1017/cbo9781316225769

P. Darlu and P. Tassy, Reconstruction phylogénétique : concepts et méthodes, 1993.

C. Darwin, On the Origin of Species, 1859. R ´ EFÉRENCESEF´EFÉRENCES BIBLIOGRAPHIQUES, p.11

C. Darwin, The Descent of Man, and Selection in Relation to Sex, 1871. [Day et al, p.37, 1986.

H. E. William, D. S. Day, D. Johnson, and . Sankoffdayhoff, The computational complexity of inferring rooted phylogenies by parsimony, Mathematical Biosciences, vol.81, issue.23, pp.33-42, 1978.

M. O. Dayhoff, R. M. Schwartz, and B. C. Orcutt, A model of evolutionary change in proteins, Atlas of Protein Sequence and Structure, pp.345-352, 1978.

A. Pyrame-de-candolle, Théorié elémentaire de la botanique, 1813.

M. Dorigo and G. Caro, Ant colony optimization: a new meta-heuristic, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), pp.11-32
DOI : 10.1109/CEC.1999.782657

R. Dorne and J. K. Hao, A new genetic local search algorithm for graph coloring, Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, pp.745-754, 1998.
DOI : 10.1007/BFb0056916

Z. Du, F. Lin, and U. W. Roshan, Reconstruction of large phylogenetic trees: A parallel approach, Computational Biology and Chemistry, vol.29, issue.4, pp.273-280, 1988.
DOI : 10.1016/j.compbiolchem.2005.06.003

C. Dupuis, Le taxinomiste face aux catégories, pp.49-109, 1988.

W. F. Anthony, L. L. Edwards, and . Cavalli-sforza, Reconstruction of evolutionary trees. Phenetic and Phylogenetic Classification, pp.67-76, 1964.

B. Efron, Bootstrap Methods: Another Look at the Jackknife, 128 R ´ EFÉRENCESEF´EFÉRENCES BIBLIOGRAPHIQUES [Essam and Fisher, pp.1-26, 1970.
DOI : 10.1214/aos/1176344552

W. John, M. E. Essam, and . Fisher, Some basic definitions in graph theory, Reviews of Modern Physics, vol.42, issue.2, pp.271-288, 1970.

E. Falkenauer, A hybrid grouping genetic algorithm for bin packing, Journal of Heuristics, vol.22, issue.2, pp.5-30, 1996.
DOI : 10.1007/BF00226291

J. S. Farris, Methods for Computing Wagner Trees, Systematic Zoology, vol.19, issue.1, pp.83-92, 1970.
DOI : 10.2307/2412028

J. S. Farris, A Probability Model for Inferring Evolutionary Trees, Systematic Zoology, vol.22, issue.3, pp.250-256, 1973.
DOI : 10.2307/2412305

J. Felsenstein, Evolutionary trees from DNA sequences: A maximum likelihood approach, Journal of Molecular Evolution, vol.24, issue.6, pp.368-376, 1981.
DOI : 10.1007/BF01734359

J. Felsenstein, Confidence Limits on Phylogenies: An Approach Using the Bootstrap, Evolution, vol.39, issue.4, pp.783-791, 1985.
DOI : 10.2307/2408678

A. Thomas, M. G. Feo, and . Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization, vol.6, pp.109-133, 1995.

R. Fisher, On an absolute criterion for fitting frequency curves, Messenger of Mathematics, vol.41, pp.155-160, 1912.

R. Fisher, On the probable error of a coefficient of correlation deduced from a small sample, Metron, vol.1, pp.3-32, 1921.

R. Fisher and R. Bibliographiques, On the Mathematical Foundations of Theoretical Statistics, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.222, issue.594-604, pp.309-368, 1922.
DOI : 10.1098/rsta.1922.0009

M. Walter and . Fitch, Toward defining the course of evolution: minimum change for a specified tree topology, Systematic Zoology, vol.20, pp.406-416, 1971.

R. Leslie, R. L. Foulds, and . Graham, The Steiner tree problem in phylogeny is NPcomplete, Advances in Applied Mathematics, vol.3, pp.43-49, 1982.

B. Freisleben and P. Merz, New genetic local search operators for the traveling salesman problem, Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature, pp.890-900, 1996.
DOI : 10.1007/3-540-61723-X_1052

P. Galinier and J. Hao, Hybrid evolutionary algorithms for graph coloring, Journal of Combinatorial Optimization, vol.3, issue.4, pp.379-397, 1999.
DOI : 10.1023/A:1009823419804

G. Ganapathy, V. Ramachandran, and T. Warnow, Better hillclimbing searches for parsimony, Proceedings of the Third International Workshop on Algorithms in Bioinformatics (WABI), pp.245-258, 2003.

G. Ganapathy, V. Ramachandran, and T. Warnow, On contractand-refine transformations between phylogenetic trees, Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.900-909, 2004.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p.20, 1979.

O. Gascuel, BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data, Molecular Biology and Evolution, vol.14, issue.7, pp.685-695, 1997.
DOI : 10.1093/oxfordjournals.molbev.a025808
URL : https://hal.archives-ouvertes.fr/lirmm-00730410

S. David and . Gladstein, Efficient incremental character optimization, Cladistics, vol.13, pp.21-26, 1997.

A. Goëffon, J. Richer, J. Hao, R. Eférencesef´eférences, and . Gö-effon, Local Search for the Maximum Parsimony Problem, Advances in Natural Computation, First International Conference, pp.678-683, 2005.
DOI : 10.1007/11539902_83

A. Goëffon, J. Richer, and J. Hao, Progressive Tree Neighborhood applied to the Maximum Parsimony Problem, Proceedings of the Mini EURO Conference on Variable Neighborhood Search, 2005.
DOI : 10.1109/TCBB.2007.1065

A. Goëffon, J. Richer, and J. Hao, Recherche localè a voisinage evolutif pour la reconstruction de phylogénies, Actes duSixì eme Congrès de la Société Française de Recherche Opérationnelle et d'Aidè a la Décision, pp.187-188, 2005.

A. Goëffon, J. Richer, and J. Hao, A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature, pp.761-770, 2006.
DOI : 10.1007/11844297_77

E. David and . Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning

P. A. Goloboff, S. Farris, and K. C. Nixon, TNT (Tree analysis using New Technology) (BETA, 2000.

P. A. Goloboff, CHARACTER OPTIMIZATION AND CALCULATION OF TREE LENGTHS, Cladistics, vol.39, issue.4, pp.433-436, 1993.
DOI : 10.1016/0025-5564(87)90074-5

P. A. Goloboff, Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima, Cladistics, vol.46, issue.4, pp.415-428, 1999.
DOI : 10.1080/106351598261012

H. Gaston, M. A. Gonnet, S. A. Cohen, and . Benner, Exhaustive matching of the entire protein sequence database, Science, vol.256, pp.1443-1445, 1992.

A. D. Gordon, Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves, Journal of Classification, vol.46, issue.2, pp.335-348, 1986.
DOI : 10.1007/BF01894195

L. Henry, W. R. Gray, and . Schucany, The Generalized Jackknife Statistic. Dekker, p.1, 1972.

C. Greenblatt and M. Spigelman, Emerging Pathogens: Archaeology, Ecology and Evolution of Infectious Disease, 2003.

S. Guindon and O. Gascuel, A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood, Systematic Biology, vol.52, issue.5, pp.696-704, 2003.
DOI : 10.1080/10635150390235520

M. Daniel and . Gusfield, Algorithms on strings, trees, and sequences: Computer science and computational biology, p.11, 1866.

E. Haeckel, Generelle Morphologie der Organismen, Georg Riemer, p.1866
DOI : 10.1515/9783110848281

P. Hansen and N. Mladenovi´cmladenovi´c, An Introduction to Variable Neighborhood Search
DOI : 10.1007/978-1-4615-5775-3_30

J. Hao, P. Galinier, and M. Habib, Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contrainte. Revue d'Intelligence Artificielle, pp.283-324, 1999.

H. Paul, J. M. Harvey, S. Smith, A. J. Nee, and . Brown, New uses for new phylogenies, 1996.

M. Hasegawa, H. Kishino, and . Yano, Dating of the human-ape splitting by a molecular clock of mitochondrial DNA, Journal of Molecular Evolution, vol.275, issue.3, pp.160-174, 1985.
DOI : 10.1007/BF02101694

S. Henikoff and J. G. Henikoff, Amino acid substitution matrices from protein blocks., Proceedings of the National Academy of Sciences, vol.89, issue.22, pp.10915-10919, 1966.
DOI : 10.1073/pnas.89.22.10915
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC50453/pdf

W. Hennighillis, Phylogenetic systematic, p.25, 1966.

M. David, B. K. Hillis, C. Mable, and . Moritz, Applications of molecular systematics and the future of the field, Molecular systematics, pp.515-543, 1996.

J. H. Holland, Adaption in Natural and Artificial Systems. The University of, 1975.

H. Holger, T. Hoos, and . Stützle, Stochastic Local Search, Foundations and Applications, 2005.

I. Horovitz, A report on one day symposium on numerical cladistics, Cladistics, vol.15, pp.177-182, 1999.

P. Hovenkamp, Review of: T.N.T.-Tree Analysis Using New Technology. Version 1.0, by P. Goloboff, J. S. Farris and K. Nixon. Available from the authors and from http://www.zmuc.dk/public/phylogeny, Cladistics, vol.46, issue.4, pp.378-383, 1940.
DOI : 10.1016/S1055-7903(03)00011-3

J. Huxley, The new systematics, 1940.

L. Jin and M. Nei, Limitations of the evolutionary parsimony method of phylogenetic analysis, Molecular Biology and Evolution, vol.7, pp.82-102, 1990.

C. Stephen and . Johnson, Hierarchical clustering schemes, Psychometrika, vol.32, pp.241-245, 1967.

D. T. Jones, W. R. Taylor, and J. M. Thornton, The rapid generation of mutation data matrices from protein sequences, Bioinformatics, vol.8, issue.3, pp.275-282, 1992.
DOI : 10.1093/bioinformatics/8.3.275

H. Thomas, C. R. Jukes, and . Cantor, Evolution of protein molecules. Mammalian protein metabolism, pp.21-123, 1969.

P. Keim, M. N. Van-ert, T. Pearson, A. J. Vogler, L. Y. Huynh et al., Anthrax molecular epidemiology and forensics: using the appropriate marker for different evolutionary scales, Infection, Genetics and Evolution, vol.4, issue.3, pp.205-213, 1980.
DOI : 10.1016/j.meegid.2004.02.005

M. Kimura, A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences, Journal of Molecular Evolution, vol.206, issue.5, Nov., pp.111-120, 1980.
DOI : 10.1007/BF01731581

S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, and R. Allersjö, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

M. Källersjö, J. S. Farris, M. W. Chase, B. Bremer, M. F. Fay et al., Simultaneous parsimony jackknife analysis of 2538rbcL DNA sequences reveals support for major clades of green plants, land plants, seed plants and flowering plants, Plant Systematics and Evolution, vol.38, issue.3-4, pp.259-287, 1998.
DOI : 10.1007/BF00985205

G. Arnold, J. S. Kluge, and . Farris, Quantitative phyletics and the evolution of anurans, Systematic Zoology, vol.18, issue.1, pp.1-32, 1969.

B. Kolaczkowski and J. W. Thornton, Performance of maximum parsimony and likelihood phylogenetics when evolution is heterogeneous, Nature, vol.13, issue.7011, pp.980-984, 2004.
DOI : 10.1080/106351501750435086

W. J. Antoon, E. Kolen, and . Pesch, Genetic local search in combinatorial optimization, Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, vol.48, 1994.

K. Mary, J. Kuhner, and . Felsenstein, A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates, Molecular Biology and Evolution, vol.11, issue.3, pp.459-468, 1994.

C. Lanave, G. Preparata, C. Saccone, and G. Serio, A new method for calculating evolutionary substitution rates, Journal of Molecular Evolution, vol.46, issue.1, pp.86-93, 1984.
DOI : 10.1007/BF02101990

H. Ailsa, A. G. Land, and . Doig, An automatic method of solving discrete programming problems, Econometrica, vol.28, issue.3, pp.497-520, 1960.

F. Lardeux, F. Saubion, and J. Hao, GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem, Evolutionary Computation, vol.400, issue.8, pp.223-253, 1998.
DOI : 10.1007/BF02241270

O. Paul and . Lewis, A genetic algorithm for maximum likelihood phylogeny inference using nucleotide sequence data, Molecular Biology and Evolution, vol.15, pp.277-283, 1998.

H. R. Lourenço, O. Martin, and T. Stützle, Iterated Local Search, Handbook of Metaheuristics of International Series in Operations Research & Management Science, pp.321-353
DOI : 10.1007/0-306-48056-5_11

M. Luckow and R. A. Pimentel, AN EMPIRICAL COMPARISON OF NUMERICAL WAGNER COMPUTER PROGRAMS, Cladistics, vol.6, issue.1, pp.47-66, 1985.
DOI : 10.1111/j.1096-0031.1985.tb00410.x

R. David and . Maddison, The discovery and importance of multiple islands of most parsimonious trees, Systematic Zoology, vol.43, issue.3, pp.315-328, 1991.

B. L. Maidak, J. R. Cole, T. G. Lilburn, C. T. Parker-jr, P. Saxman et al., The RDP (Ribosomal Database Project) continues, The RDP-II (Ribosomal Database Project, pp.173-174, 1996.
DOI : 10.1093/nar/28.1.173

H. Matsuda, Protein phylogenetic inference using maximum likelihood with a genetic algorithm, Proceedings of 1st Pacific Symposium on Biocomputing, pp.512-523, 1984.

C. A. Meacham, The Role of Hypothesized Direction of Characters in the Estimation of Evolutionary History, Taxon, vol.33, issue.1, pp.26-38, 1984.
DOI : 10.2307/1222026

P. Merz and B. Freisleben, A genetic local search approach to the quadratic assignment problem, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), pp.465-472, 1953.

. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics, vol.21, issue.6, pp.1087-1092, 1953.

Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 1996.
DOI : 10.1007/978-3-662-02830-8

D. Charles, R. R. Michener, and . Sokal, A statistical method for evaluating systematic relationships, University of Kansas Science Bulletin, vol.38, pp.1409-1438, 1958.

L. Brad, D. E. Miller, R. Goldberg, and . Bibliographiques, Genetic algorithms, tournament selection, and the effects of noise, Complex Systems, vol.9, pp.193-212, 1995.

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

A. Moilanen, Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization, Cladistics, vol.4, issue.1, pp.39-50, 1999.
DOI : 10.1109/3477.485836

P. Moscato, Memetic algorithms: A short introduction, New Ideas in Optimization, pp.219-234, 1999.

D. W. Mount, Bioinformatics: sequence and genome analysis, 2001.

Y. Nagata and S. Kobayashi, Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem, Proceedings of the Seventh International Conference on Genetic Algorithms, pp.450-457, 1997.

M. Nei and S. Kumar, Molecular Evolution and Phylogenetics, 2000.

J. Neyman, Molecular studies of evolution: A source of novel statistical problems. Statistical Decision Theory and Related Topics, pp.1-27, 1971.

K. C. Nixon, The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis, Cladistics, vol.46, issue.4, pp.407-414, 1999.
DOI : 10.1006/clad.1999.0101

C. H. Papadimitriou, Computational Complexity, p.60, 1994.

E. Pennisi, Modernizing the Tree of Life, Science, vol.300, issue.5626, pp.1692-1697, 1987.
DOI : 10.1126/science.300.5626.1692

I. Norman and . Platnick, An empirical comparison of microcomputer parsimony programs, Cladistics, vol.3, pp.121-144, 1987.

I. Norman and . Platnick, An empirical comparison of microcomputer parsimony programs II, Cladistics, vol.5, pp.145-161, 1989.

L. J. Donald, J. Quicke, A. Taylor, and . Purvis, Changing the landscape: A new strategy for estimating large phylogenies, Systematic Biology, vol.50, issue.1, pp.60-66, 1992.

M. A. Ragan, Phylogenetic inference based on matrix representation of trees, Molecular Phylogenetics and Evolution, vol.1, issue.1, pp.53-58, 1992.
DOI : 10.1016/1055-7903(92)90035-F

A. Rambaut, D. L. Robertson, O. G. Pybus, M. Peeters, and E. C. Holmes, Phylogeny and the origin of hiv-1, Nature, vol.410, issue.6832, pp.1047-1048, 1993.
DOI : 10.1038/35074179

C. C. Reeves, Modern Heuristic Techniques for Combinatorial Problems, 1993.

C. Celso, D. S. Ribeiro, and . Vianna, A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking, II Workshop Brasileiro de Bioinformática, pp.97-102, 2003.

C. Celso, D. S. Ribeiro, and . Vianna, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure, International Transactions in Operational Research, vol.12, pp.325-338, 2005.

K. Rice and T. Warnow, Parsimony is hard to beat!, Computing and Combinatorics, pp.124-133
DOI : 10.1007/BFb0045079

F. David, L. R. Robinson, and . Foulds, Comparison of phylogenetic trees, Mathematical Biosciences, vol.53, pp.131-147, 1981.

F. David and . Robinson, Comparison of labeled trees with valency three, Journal of Combinatorial Theory, Series B, vol.11, pp.105-119, 1971.

A. Rzhetsky and M. Nei, A simple method for estimating and testing minimum-evolution trees, Molecular Biology and Evolution, vol.9, pp.945-967, 1992.

A. Rzhetsky, M. Nei, and R. Bibliographiques, Theoretical foundation of the minimum-evolution method of phylogenetic inference, Molecular Biology and Evolution, vol.10, pp.1073-1095, 1987.

N. Saitou and M. Nei, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Sankoff and Rousseau, pp.406-425, 1975.

D. Sankoff and P. Rousseau, Locating the vertices of a steiner tree in an arbitrary metric space, Mathematical Programming, pp.240-246, 1975.
DOI : 10.1007/BF01681346

D. Sankoff, Minimal Mutation Trees of Sequences, SIAM Journal on Applied Mathematics, vol.28, issue.1, pp.35-42, 1975.
DOI : 10.1137/0128004

E. Schröder, Vier kombinatorische probleme, Zeitschrift für Mathematik und Physik, pp.361-376, 1870.

G. Gaylord-simpson, Principles of animal taxonomy, 1961.

H. A. Peter, R. R. Sneath, and . Sokal, Numerical Taxonomy: The Principles and Practice of Numerical Classification, 1973.

Q. Snell, M. Whiting, M. Clement, and D. Mclaughlin, Parallel Phylogenetic Inference, ACM/IEEE SC 2000 Conference (SC'00), pp.62-62, 2000.
DOI : 10.1109/SC.2000.10062
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.6595

R. Robert, C. D. Sokal, and . Michener, A quantitative approach to a problem in classification, Evolution, vol.11, pp.130-162, 1957.

J. Sourdis and M. Nei, Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree, Molecular Biology and Evolution, vol.5, pp.298-311, 1988.

A. Stamatakis, An Efficient Program for Phylogenetic Inference Using Simulated Annealing, 19th IEEE International Parallel and Distributed Processing Symposium, p.198, 2005.
DOI : 10.1109/IPDPS.2005.90

L. David, G. J. Swofford, and . Olsen, Phylogeny reconstruction, Molecular systematics, pp.411-501, 1990.

L. David, G. J. Swofford, P. J. Olsen, D. M. Waddell, and . Hillis, Phylogenetic inference, Molecular systematics, pp.407-514, 1996.

L. David, . Swofford, and . Paup-*, Phylogenetic Analysis Using Parsimony (*and other methods ) Version 4, 2002.

K. Tamura and M. Nei, Estimation of the number of nucleotide substitutions in the control region of mitochondrial DNA in humans and chimpanzees, Molecular Biology and Evolution, vol.10, pp.512-526, 1993.

K. Tamura, Estimation of the number of nucleotide substitutions when there are strong transition-transversion and G+C content biases, Molecular Biology and Evolution, vol.9, pp.678-687, 1992.

P. Tassy and . L-'ordre-et-la-diversité-du-vivant, Quel statut scientifique pour les classifications biologiques ? Fondation Diderot (Paris), p.23, 1986.

S. Tavaré, Some probabilistic and statistical problems on the analysis of DNA sequences, Lectures on Mathematics in the Life Sciences, vol.17, pp.57-86, 1939.

C. Robert and . Tryon, Cluster Analysis Edwards Brothers (Ann Arbor), 1939. [Tukey, p.56, 1958.

J. W. Tukey, Bias and confidence in not-quite large samples, Annals of Mathematical Statistics, p.614, 1958.

L. J. Nico, E. H. Ulder, H. Aarts, . Bandelt, J. M. Peter et al., Genetic local search algorithms for the traveling salesman problem

R. V. Vidal, Applied Simulated Annealing, 1993.
DOI : 10.1007/978-3-642-46787-5

L. Carl-von, Systema Naturae per regna tria naturae, secundum classes, ordines, genera, species, cum characteribus differentiis, synonymis, locis, pp.1735-1770

J. H. Ward, Hierarchical Grouping to Optimize an Objective Function, Journal of the American Statistical Association, vol.58, issue.301, pp.236-244, 1963.
DOI : 10.1007/BF02289263

S. Michael, T. F. Waterman, and . Smith, On the similarity of dendrograms, Journal of Theoretical Biology, vol.73, pp.784-900, 1978.

M. Yan and D. A. Bader, Fast character optimization in parsimony phylogeny reconstruction, 2003.

A. Goëffon, J. Richer, and J. Hao, En révision Conférences internationales avec comité de selection 1, Hao A Distance-based Information Preservation Tree Crossover for the Maximum Parsimony Problem Proceedings of the 9th International Conference on Parallel Problem Solving from Nature, pp.761-770, 2006.

A. Goëffon, J. Richer, and J. Hao, Local Search for the Maximum Parsimony Problem, Local Search for the Maximum Parsimony Problem Proceedings of the First International Conference on Natural Computation, pp.678-683, 2005.
DOI : 10.1007/11539902_83

A. Goëffon, J. Richer, and J. Hao, Voisinage d'arbré evolutif appliqué auprobì eme Maximum Parcimonie Actes desPremì eres Journées Francophones de Programmation par Contraintes, pp.443-446, 2005.