If you’ve ever looked at an evolutionary tree, contemplated phylogeny, cladistics, or the like, you’re probably aware that Joe Felsenstein is one of the leaders of the pack.
And you will certainly enjoy, this interview that Blind Scientist has posted.
I wouldn’t advise reading the interview to learn about doing phylogenetics, but you will learn a bit about the social anthropology of the field. Felsenstein does a wonderful job of supplying historical context to phylogenetic arguments and filling in the missing details.
A phylogenetic tree is a kind of model or hypothesis that’s put forth to describe the evolutionary history of certain species. In the days before high-throughput DNA sequencing, people would propose trees and argue about them, but no one could really know which tree was true. The proponents of parsimony were adamant that evolution could only proceed by the most mathematically-pleasing process. In other words, they argued that the tree, or evolutionary path with the fewest number of changes must, by necessity, be the best. (The most parsimonious tree is one with the fewest changes.)
As a biologist, of course, I never understood that sort of logic. And, the experiments confirmed that biological systems didn’t grasp it either.
To me, it made much more sense to use models that recognized the existence of chemistry and agree that some changes between nucleotides happen more often than others.
Since those days, experimental data have demonstrated that the maximum likelihood algorithm in Felsentein’s Phylip package does produce better trees. Maximum-likelihood trees mimic reality the best, with the neighbor-joining algorithm doing pretty well, too, and parsimony, last.
JF also shares his opinions on open source software and corrects some misconceptions. Phylip, for example, like other famous bioinformatics programs developed at the UW, is not open source and must be licensed from the University for commercial use.
Whether you agree with his ideas or not, JF’s reasons for preferring that route are worth a read.