Bioinformatics: sequence and genome analysis. D. W. Mount. Cold Spring Harbor Laboratory Press, New York (2001). http://www.bioinformaticsonline.org Algorithms for molecular biology. R. Shamir. Course lecture notes, Tel Aviv (2001). http://www.math.tau.ac.il/~rshamir/algmb.html Evolution M. W. Strickberger. Jones and Bartlett, Massachusetts (1996). Dynamic programming. R. Bellman. Princeton University Press, Boston (1957). A general method applicable to the search for similarities in the amino acid sequences of two proteins. S.B. Needleman and C.D. Wunsch. Journal of Molecular Biology 48:443-453 (1970). Identification of common molecular subsequences T.F. Smith and M.S. Waterman. Journal of Molecular Biology 147:195-197 (1981). Progressive sequence alignment as a prerequisite to correct phylogenetic trees. D.F. Feng and R.F. Doolittle. Journal of Molecular Evolution 25:351-360 (1987). Construction of phylogenetic trees. W.M. Fitch and E. Margoliash. Science 155:279-284 (1987). The neighbor-joining method: a new method for reconstructing phylognetic trees. N. Saitou and M. Nei. Molecular Biology and Evolution 4:406-425 (1987). Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Felstein. Journal of Molecular Biology 17:368-376 (1981). Inferring phylogeny from protein sequences by parsimony, distance and likelihood methods. J. Felstein. Methods Enzymology 266:368-382 (1996). PHYLIP: http://evolution.genetics.washington.edu/phylip.html