Computational phylogenetics
Application of computational algorithms
Follow Computational phylogenetics on Notably News to receive short updates to your email — rarely!
We include updates on Needleman–Wunsch algorithm, Smith–Waterman algorithm, BLOSUM, Sequence alignment, Multiple sequence alignment, UPGMA, Hirschberg's algorithm, Substitution model, Complete-linkage clustering, Neighbor joining, Gap penalty, Conserved sequence, Joseph Felsenstein, Disk-covering method, Tree alignment, Generalized tree alignment ... and more.
2018 |
Substitution model
Sun et al. published a study demonstrating the annotation of majority-rule consensus of Maximum Parsimony trees with Bayesian posterior probabilities using the Mk model, highlighting a novel application of substitution models in phylogenetic analysis.
|
2018 |
Substitution model
Posterior mean site frequency (PMSF) model is developed as a computationally-cheaper approximation of empirical-profile mixture models.
|
This contents of the box above is based on material from the Wikipedia articles Needleman–Wunsch algorithm & Substitution model, which are released under the Creative Commons Attribution-ShareAlike 4.0 International License.