Ok-k-mer: Selecting k-mer length ensembles for calculating genomic distance
Ok-k-mer selects optimal k-mer length ensembles to improve genomic distance estimation by maximizing correlation with phylogenetic branch distances.
Author
Johns Hopkins UniversityORCID 0000-0003-0299-569XUnclaimed ORCID profile · follow to get notified of new preprints
5 papers
Recent·Most cited
Ok-k-mer selects optimal k-mer length ensembles to improve genomic distance estimation by maximizing correlation with phylogenetic branch distances.
Xian H. Chang, Adam M. Novak, Jordan M. Eizenga…·Benedict Paten
The paper updates Giraffe to map both long and short reads to large pangenome graphs, showing improved speed and accuracy compared to existing tools.
Sina Majidian, Stephen Hwang, Mohsen Zakeri, Ben Langmead
The paper benchmarks ANI estimation algorithms using simulated and real datasets, showing that ANIb is most accurate but least efficient, while k-mer approaches are efficient and accurate, with some clades requiring multiple k-values.
Stephen Hwang, Nathaniel K. Brown, Omar Y. Ahmed…·Ben Langmead
The paper introduces MEMO, a pangenome indexing method that efficiently handles k-mer queries and conservation analysis across pangenomes.