activity
20112017
most citedSpaced seeds improve k-mer-based metagenomic classification

112 citations · 167 across the 6 of their papers we have counts for

collaborators

7 papers

q-bio.GN2017

Ococo: an online variant and consensus caller

Karel Břinda, Valentina Boeva, Gregory Kucherov

Motivation: Identifying genomic variants is an essential step for connecting genotype and phenotype. The usual approach consists of statistical inference of variants from alignment…

cs.HC2016★ 23 cited

Blind Friendly Maps: Tactile Maps for the Blind as a Part of the Public Map Portal (Mapy.cz)

Petr Červenka, Karel Břinda, Michaela Hanousková +2

Blind people can now use maps located at Mapy.cz, thanks to the long-standing joint efforts of the ELSA Center at the Czech Technical University in Prague, the Teiresias Center at…

q-bio.GN2015★ 11 cited

RNF: a general framework to evaluate NGS read mappers

Karel Břinda, Valentina Boeva, Gregory Kucherov

Aligning reads to a reference sequence is a fundamental step in numerous bioinformatics pipelines. As a consequence, the sensitivity and precision of the mapping tool, applied with…

q-bio.GN2015★ 112 cited

Spaced seeds improve k-mer-based metagenomic classification

Karel Brinda, Maciej Sykulski, Gregory Kucherov

Metagenomics is a powerful approach to study genetic content of environmental samples that has been strongly promoted by NGS technologies. To cope with massive data involved in mod…

cs.DM2014

Languages of lossless seeds

Karel Břinda

Several algorithms for similarity search employ seeding techniques to quickly discard very dissimilar regions. In this paper, we study theoretical properties of lossless seeds, i.e…

math.CO2013★ 5 cited

Balances of -bonacci words

Karel Břinda, Edita Pelantová, Ondřej Turek

The -bonacci word is a generalization of the Fibonacci word to the -letter alphabet . It is the unique fixed point of the Pisot--type substitution…

math.CO2011★ 16 cited

Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

Ľubomíra Balková, Karel Břinda, Ondřej Turek

We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.