New preprint: we used k-mer matching with suffix match length information to create an assembly-to-assembly alignment algorithm + software for bacterial genomes, kbo.
kbo uses the SBWT data structure which lets us run a query in 1-10s and 500-1000MB RAM, depending on the task and parameters.
All our algorithms run in the browser, try the tool at maklin.fi/kbo/ There is no server-side processing, so the data never leaves your computer.
link: https://www.biorxiv.org/content/10.1101/2025.05.19.654936v2