KATKA: A KRAKEN-like tool with k given at query time

06/13/2022
by   Travis Gagie, et al.
0

We describe a new tool, KATKA, that stores a phylogenetic tree T such that later, given a query P and an integer k, it can quickly return the root of the smallest subtree of T containing all the genomes in which the k-mer P [i..i + k - 1] occurs, for 1 ≤ i ≤ m - k + 1. This is similar to KRAKEN's functionality but with k given at query time instead of at construction time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2020

Dynamic Distribution-Sensitive Point Location

We propose a dynamic data structure for the distribution-sensitive point...
research
02/28/2021

Weighted Ancestors in Suffix Trees Revisited

The weighted ancestor problem is a well-known generalization of the pred...
research
07/05/2017

Eclipse: Practicability Beyond 1NN and Skyline

In this paper, we propose a novel Eclipse query which is more practical ...
research
05/30/2019

Compact Data Structures for Shortest Unique Substring Queries

Given a string T of length n, a substring u = T[i.. j] of T is called a ...
research
02/04/2021

Gapped Indexing for Consecutive Occurrences

The classic string indexing problem is to preprocess a string S into a c...
research
06/02/2020

Efficient tree-structured categorical retrieval

We study a document retrieval problem in the new framework where D text ...
research
10/30/2018

SBT-instrumentation: A Tool for Configurable Instrumentation of LLVM Bitcode

The paper describes a member of the Symbiotic toolbox called sbt-instrum...

Please sign up or login with your details

Forgot password? Click here to reset