3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2013
Approximate String Matching using a Bidirectional Index
Gregory Kucherov, Kamil Salikhov, Dekel Tsur
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of Lam et al. We introduce a formalism, called search…
cs.DS2013★ 3 cited
Using cascading Bloom filters to improve the memory usage for de Brujin graphs
Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
De Brujin graphs are widely used in bioinformatics for processing next-generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn…