Neighbor-Joining revealed

dc.contributor.authorGascuel, O.
dc.contributor.authorSteel, M.
dc.date.accessioned2007-07-17T04:19:51Z
dc.date.available2007-07-17T04:19:51Z
dc.date.issued2006en
dc.description.abstractIt is nearly 20 years since the landmark paper (Saitou and Nei 1987) in Molecular Biology and Evolution introducing Neighbor-Joining (NJ). The method has become the most widely used method for building phylogenetic trees from distances, and the original paper has been cited about 13,000 times (Science Citation Index). Yet the question ‘‘what does the NJ method seek to do?’’ has until recently proved somewhat elusive, leading to some imprecise claims and misunderstanding. However, a rigorous answer to this question has recently been provided by further mathematical investigation, and the purpose of this note is to highlight these results and their significance for interpreting NJ. The origins of this story lie in a paper by Pauplin (2000) though its continuation has unfolded in more mathematically inclined literature. Our aim here is to make these findings more widely accessible.en
dc.identifier.citationGascuel, O., Steel, M. (2006) Neighbor-Joining revealed. Molecular Biology and Evolution, 23(11), pp. 1997-2000.en
dc.identifier.urihttp://hdl.handle.net/10092/227
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematics and Statistics.en
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectdistance methoden
dc.subjectalgorithmen
dc.subjectphylogenetic criterionen
dc.subjectminimum evolutionen
dc.subjectconsistencyen
dc.subjectneighbor-joiningen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematicsen
dc.titleNeighbor-Joining revealeden
dc.typeJournal Article
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
12603425_Main.pdf
Size:
103.28 KB
Format:
Adobe Portable Document Format