A small break
Taking a small break this month, but keep a look out for future posts where i’ll cover some fundamentals of Continue Reading …
What is a k-mer?
A k-mer is a substring of a biological sequence with length K, where K can be any number. If you Continue Reading …
Coalescent trees and Bugs in a box
Imagine tracing a tree diagram backwards in time, from the tips all the way back to its root. At each Continue Reading …
The Neighbour-Joining algorithm: Ties and Matrix Order
Following on from the previous post Foundations of phylogenetics we’ll next explore how ties and matrix order can influence the Continue Reading …
Foundations of phylogenetics
For many years it was believed that patterns of evolution are tree-like and sometimes they are! We now know that Continue Reading …
Clustering to Reveal Hidden Traits: Using Neighbour-Joining Trees
Before we dive into the theory behind the Neighbour-Joining algorithm I wanted to do a simple conceptual exercise to highlight Continue Reading …
Taking a break
This month I’m putting a brief pause on posts, but they’ll be back next month – look out for: See Continue Reading …
What is a hidden markov model?
A Hidden Markov Model (HMM) is a type of probabilistic model that tries to explain the underlying structure behind a Continue Reading …
AI UK 2025
A few weeks ago I attended AI UK 2025 – a showcase of the latest applications of AI. There were Continue Reading …