|
Neighbor-joining
In bioinformatics, neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987. Usually based on DNA or protein sequence data, the algorithm requires knowledge of the distance between each pair of taxa (e.g., species or sequences) to create the phylogenetic tree. The algorithm Neighbor joining takes a distance matrix, which specifies the distance between each pair of taxa, as input. The algorithm starts with a completely unresolved tree, whose topology corresponds to that of a star network, and iterates over the following steps, until the tree is completely resolved, and all branch lengths are known: # Based on the current distance matrix, calculate a matrix Q (defined below). # Find the pair of distinct taxa i and j (i.e. with i \neq j) for which Q(i,j) is smallest. Make a new node that joins the taxa i and j, and connect the new node to the central node. For example, in part (B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Phylogenetics
Computational phylogenetics is the application of computational algorithms, methods, and programs to phylogenetic"origin,_source,_birth")_is_the_study_of_the_evolutionary_his_... "origin, source, birth") is the study of the evolutionary his ... "origin, source, birth") is the study of the evolutionary his ... "origin, source, birth") is the study of the evolutionary his ... "origin, source, birth") is the study of the evolutionary his ... "tribe, clan, race", and wikt:γενετικός, γενετικός [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
