Referencias
[1] Ribeiro, Celso C.; Vianna, Dalessandro S., A GRASP/VND heuristic for the phylogeny problem
using a new neighborhood structure, International Transactions in Operational Research, vol. 12, no.
3, pp. 325-338, 2005.
[2] Andreatta , Alexandre A.; Ribeiro, Celso C., Heuristics for the phylogeny problem, Journal of
Heuristics, vol. 8, no. 4, pp. 429-447, 2002.
[3] Kruskal, J. B., On the shortest spanning subtree of a graph and the traveling salesman problem,
Proceedings of the American Mathematical Society, vol. 7, pp. 48-50, 1956.
[4] Osman, I. H., An introduction to meta-heuristics, Operational Research Tutorial Papers, 1995,
Birmingham, UK, pp. 92-122.
[5] Prim R. C., Shortest connection networks and some generalizations, Bell System Technical
Journal, vol. 36, pp. 1389-1401, 1957.
[6] Urrutia, Loiseau I., A new metaheuristic and its application to the Steiner Problems in graph,
Tesis de Licenciatura, FCEyN, Universidad de Buenos Aires, 2001.
[7] Esbensen, H., Computing near-optimal solutions to the Steiner Problem in a graph using a genetic
algorithm, Networks, vol. 26, pp. 173-185, 1995.
[8] Garey, M. R.; Johnson, D. S., Computers and intractability: A guide to the theory of NPCompleteness,
Bell Laboratories, Murray, New Jersey, 1979.
[9] Wiki, Especiación, disponible en línea en
http://es.beekeeping.wikia.com/wiki/Especiaci%C3%B3n, consultado en agosto del 2007.
[10] Puertas, M. J., Genética: Fundamentos y perspectivas, Interamericana, 1999
[11] Cavalli-Sforza, L. L.; Bodmer, W. F., Genetics of human populations, Omega, 1981.
[12] Curtis, Helena; Barnes, N.Sue, Biología, Buenos Aires, Panamericana, 1993.
[13] Blum, C.; Roli, A., Metaheuristics in Combinatorial Optimization: Overview and Conceptual
Comparison, ACM Computing Surveys, vol. 35, no. 3, pp. 268-308, 2003.
[14] Mount, D. W., Bioinformatics: Sequence and Genome Analysis, CSHL Press, 2004.
[15] Lesk, Arthur M., Introduction to Bioinformatics, Oxford University Press, 2005.
