Editing Neighbor joining (section)

{{short description|Bottom-up clustering method for creating phylogenetic trees}}
In [[bioinformatics]], '''neighbor joining''' is a bottom-up (agglomerative) [[Cluster analysis|clustering]] method for the creation of [[phylogenetic trees]], created by Naruya Saitou and [[Masatoshi Nei]] in 1987.<ref>{{Cite journal|title=The neighbor-joining method: a new method for reconstructing phylogenetic trees.|first1=N.|last1=Saitou|first2=M.|last2=Nei|date=1 July 1987|journal=Molecular Biology and Evolution|volume=4|issue=4|pages=406–425|doi=10.1093/oxfordjournals.molbev.a040454|pmid=3447015|doi-access=free}}</ref> Usually based on [[DNA]] or [[protein]] [[primary structure|sequence]] data, the algorithm requires knowledge of the distance between each pair of [[taxa]] (e.g., species or sequences) to create the phylogenetic tree.<ref>
{{cite book
 | title = Bacterial Population Genetics in Infectious Disease
 |editor1=D. Ashley Robinson |editor2=Daniel Falush |editor3=Edward J. Feil | chapter = Sequence-Based Analysis of Bacterial Population Structures
 | author = Xavier Didelot
 | publisher = John Wiley and Sons
 | year = 2010
 | isbn = 978-0-470-42474-2
 | pages = 46–47
 | chapter-url = https://books.google.com/books?id=gPVjfsWnGCcC&pg=PA46
 }}</ref>