Brona Brejová

Orcid: 0000-0002-9483-1766

Affiliations:
  • University in Bratislava, Slovakia


According to our database1, Brona Brejová authored at least 59 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
PlasBin-flow: a flow-based MILP algorithm for plasmid contigs binning.
Bioinform., 2023

Identifying Clusters in Graph Representations of Genomes.
Proceedings of the 23rd Conference Information Technologies, 2023

Precise Nanopore Signal Modeling Improves Unsupervised Single-Molecule Methylation Detection.
Proceedings of the 23rd Conference Information Technologies, 2023

2022
VirPool: model-based estimation of SARS-CoV-2 variant proportions in wastewater samples.
BMC Bioinform., December, 2022

Dynamic Pooling Improves Nanopore Base Calling Accuracy.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

2021
Nanopore base calling on the edge.
Bioinform., 2021

SnakeLines Workflow for SARS-CoV-2 Variant Detection from Next-Generation Sequencing Reads.
Proceedings of the 21st Conference Information Technologies, 2021

Estimation of Proportions of SARS-CoV-2 Variants in a Mixed Sequencing Sample.
Proceedings of the 21st Conference Information Technologies, 2021

Sequencing SARS-CoV-2 in Slovakia: An Unofficial Genomic Surveillance Report.
Proceedings of the 21st Conference Information Technologies, 2021

Alternative Base Callers Aid Real-time Analysis of SARS-CoV-2 Sequencing Runs.
Proceedings of the 21st Conference Information Technologies, 2021

Time-adjusted Analysis Shows Weak Associations Between BCG Vaccination Policy and COVID-19 Disease Progression.
Proceedings of the 21st Conference Information Technologies, 2021

Probabilistic Models of k-mer Frequencies (Extended Abstract).
Proceedings of the Connecting with Computability, 2021

2020
DeepNano-blitz: a fast base caller for MinION nanopore sequencers.
Bioinform., 2020

A Linear-Time Algorithm for the Isometric Reconciliation of Unrooted Trees.
Algorithms, 2020

2019
Dante: genotyping of known complex and expanded short tandem repeats.
Bioinform., 2019

2017
Isometric gene tree reconciliation revisited.
Algorithms Mol. Biol., 2017

Using Sequence Ensembles for Seeding Alignments of MinION Sequencing Data.
Proceedings of the 17th Conference on Information Technologies, 2017

Approximate Abundance Histograms and Their Use for Genome Size Estimation.
Proceedings of the 17th Conference on Information Technologies, 2017

2016
RNA motif search with data-driven element ordering.
BMC Bioinform., 2016

OB-Fold Recognition Combining Sequence and Structural Motifs.
Proceedings of the 16th ITAT Conference Information Technologies, 2016

2015
Sequence annotation with HMMs: New problems and their complexity.
Inf. Process. Lett., 2015

GAML: genome assembly by maximum likelihood.
Algorithms Mol. Biol., 2015

How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra.
Proceedings of the String Processing and Information Retrieval, 2015

Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly.
Proceedings of the String Processing and Information Retrieval, 2015

2014
Probabilistic approaches to alignment with tandem repeats.
Algorithms Mol. Biol., 2014

Neuropeptide Recognition by Machine Learning Methods.
Proceedings of the main track of the 14th Conference on Information Technologies - Applications and Theory (ITAT 2014), with selected papers from Znalosti 2014 collocated with Znalosti 2014, Demanovska Dolina - Jasna, Slovakia, September 25, 2014

An Improved Algorithm for Ancestral Gene Order Reconstruction.
Proceedings of the main track of the 14th Conference on Information Technologies - Applications and Theory (ITAT 2014), with selected papers from Znalosti 2014 collocated with Znalosti 2014, Demanovska Dolina - Jasna, Slovakia, September 25, 2014

2013
Efficient routing in carrier-based mobile networks.
Theor. Comput. Sci., 2013

DNA Sequence Segmentation Based on Local Similarity.
Proceedings of the Conference on Information Technologies, 2013

Variants of Genes from the Next Generation Sequencing Data.
Proceedings of the Conference on Information Technologies, 2013

2012
Aligning sequences with repetitive motifs.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2012

2011
A Practical Algorithm for Ancestral Rearrangement Reconstruction.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Automated Segmentation of DNA Sequences with Complex Evolutionary Histories.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2011

Routing in Carrier-Based Mobile Networks.
Proceedings of the Structural Information and Communication Complexity, 2011

Gene finding with complex external information.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2011

2010
Reconstructing Histories of Complex Gene Clusters on a Phylogeny.
J. Comput. Biol., 2010

Estimating effective DNA database size via compression.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2010

The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Bayesian History Reconstruction of Complex Human Gene Clusters on a Phylogeny
CoRR, 2009

Predicting Gene Structures from Multiple RT-PCR Tests.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2007
The most probable annotation problem in HMMs and its application to bioinformatics.
J. Comput. Syst. Sci., 2007

On-line Viterbi Algorithm and Its Relationship to Random Walks
CoRR, 2007

On-Line Viterbi Algorithm for Analysis of Long Biological Sequences.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Homology search for genes.
Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007

2006
New Bounds for Motif Finding in Strong Instances.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Evidence Combination in Hidden Markov Models for Gene Prediction.
PhD thesis, 2005

Vector seeds: An extension to spaced seeds.
J. Comput. Syst. Sci., 2005

ExonHunter: a comprehensive approach to gene finding.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Finding hidden independent sets in interval graphs.
Theor. Comput. Sci., 2004

Optimal Spaced Seeds for Homologous Coding Regions.
J. Bioinform. Comput. Biol., 2004

The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003
Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specifity.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Analyzing variants of Shellsort.
Inf. Process. Lett., 2001

2000
Simplifying Flow Networks.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000


  Loading...