Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Kashgouli, Sana"'
We describe a new tool, KATKA, that stores a phylogenetic tree $T$ such that later, given a pattern $P [1..m]$ 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
Externí odkaz:
http://arxiv.org/abs/2206.06053
Suppose we are asked to index a text $T [0..n - 1]$ such that, given a pattern $P [0..m - 1]$, we can quickly report the maximal substrings of $P$ that each occur in $T$ at least $k$ times. We first show how we can add $O (r \log n)$ bits to Rossi et
Externí odkaz:
http://arxiv.org/abs/2202.05085