Sebastian Deorowicz

Heng Li

Bioinform., March, 2023

2022

PHIST: fast and accurate prediction of prokaryotic hosts from metagenomic viral sequences.

[BibT_eX]

[DOI]

Andrzej Zielezinski

Bioinform., 2022

The K-mer File Format: a standardized and compact disk representation of sets of <i>k</i>-mers.

[BibT_eX]

[DOI]

Bioinform., 2022

2021

Whisper 2: Indel-sensitive short read mapping.

[BibT_eX]

[DOI]

SoftwareX, 2021

VCFShark: how to squeeze a VCF file.

[BibT_eX]

[DOI]

Bioinform., 2021

2019

CoMSA: compression of protein multiple sequence alignment files.

[BibT_eX]

[DOI]

Joanna Walczyszyn

Bioinform., 2019

Kmer-db: instant evolutionary distance estimation.

[BibT_eX]

[DOI]

Bioinform., 2019

Whisper: read sorting allows robust mapping of DNA sequencing data.

[BibT_eX]

[DOI]

Bioinform., 2019

GTShark: genotype compression in large projects.

[BibT_eX]

[DOI]

Bioinform., 2019

2018

FaStore: a space-saving solution for raw sequencing data.

[BibT_eX]

[DOI]

Bioinform., 2018

GTC: how to maintain huge genotype collections in a compressed form.

[BibT_eX]

[DOI]

Bioinform., 2018

2017

Even better correction of genome sequencing data.

[BibT_eX]

[DOI]

CoRR, 2017

KMC 3: counting and manipulating k-mer statistics.

[BibT_eX]

[DOI]

Bioinform., 2017

RECKONER: read error corrector based on KMC.

[BibT_eX]

[DOI]

Bioinform., 2017

Even Faster Sorting of (Not Only) Integers.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 5, 2017

Improvements in DNA Reads Correction.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 5, 2017

Sorting Data on Ultra-Large Scale with RADULS - New Incarnation of Radix Sort.

[BibT_eX]

[DOI]

Proceedings of the Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation, 2017

FM-index for Dummies.

[BibT_eX]

[DOI]

Marcin Raniszewski

Proceedings of the Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation, 2017

2016

Aligning 415 519 proteins in less than two hours on PC.

[BibT_eX]

[DOI]

CoRR, 2016

Comment on: 'ERGC: an efficient referential genome compression algorithm'.

[BibT_eX]

[DOI]

Bioinform., 2016

2015

Indexing arbitrary-length k-mers in sequencing reads.

[BibT_eX]

[DOI]

Tomasz Marek Kowalski

CoRR, 2015

QuickProbs 2: towards rapid construction of high-quality alignments of large protein families.

[BibT_eX]

[DOI]

CoRR, 2015

GDC 2: Compression of large collections of genomes.

[BibT_eX]

[DOI]

Marcin Niemiec

CoRR, 2015

Disk-based compression of data from genome sequencing.

[BibT_eX]

[DOI]

Lukasz Roguski

Bioinform., 2015

KMC 2: fast and resource-frugal <i>k</i>-mer counting.

[BibT_eX]

[DOI]

Bioinform., 2015

2014

Efficient algorithms for the longest common subsequence in k-length substrings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Disk-based genome sequencing data compression.

[BibT_eX]

[DOI]

Lukasz Roguski

CoRR, 2014

KMC 2: Fast and resource-frugal k-mer counting.

[BibT_eX]

[DOI]

CoRR, 2014

Indexing large genome collections on a PC.

[BibT_eX]

[DOI]

CoRR, 2014

DSRC 2 - Industry-oriented compression of FASTQ files.

[BibT_eX]

[DOI]

Lukasz Roguski

Bioinform., 2014

An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures.

[BibT_eX]

[DOI]

Proceedings of the Beyond Databases, Architectures, and Structures, 2014

An Improved Algorithm for Fast and Accurate Classification of Sequences.

[BibT_eX]

[DOI]

Jolanta Kawulok

Proceedings of the Beyond Databases, Architectures, and Structures, 2014

2013

Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Disk-based k-mer counting on a PC.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

Genome compression: a novel approach for large collections.

[BibT_eX]

[DOI]

Bioinform., 2013

Data compression for sequencing data.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2013

Fast and Simple Circular Pattern Matching.

[BibT_eX]

[DOI]

Robert Susik

Proceedings of the Man-Machine Interactions 3, 2013

Subcubic Algorithms for the Sequence Excluded LCS Problem.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 3, 2013

Kalign-LCS - A More Accurate and Faster Variant of Kalign2 Algorithm for the Multiple Sequence Alignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 3, 2013

Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Michal Wojciech Szczesniak

Proceedings of the Man-Machine Interactions 3, 2013

2012

miRNEST database: an integrative approach in microRNA search and annotation.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2012

Quadratic-time algorithm for a string constrained LCS problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem Designed for GPUs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem.

[BibT_eX]

[DOI]

Comput. Informatics, 2012

2011

Engineering Relative Compression of Genomes

[BibT_eX]

[DOI]

CoRR, 2011

Robust relative compression of genomes with random access.

[BibT_eX]

[DOI]

Bioinform., 2011

Compression of DNA sequence reads in FASTQ format.

[BibT_eX]

[DOI]

Bioinform., 2011

Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks.

[BibT_eX]

[DOI]

Piotr Pecka

Mateusz Nowak

Proceedings of the Man-Machine Interactions 2, 2011

A Parallel GPU-Designed Algorithm for the Constrained Multiple Sequence Alignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 2, 2011

2010

Solving longest common subsequence and related problems on graphical processing units.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2010

Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Constrained Longest Common Subsequence Computing Algorithms in Practice.

[BibT_eX]

[DOI]

Joanna Obstój

Comput. Informatics, 2010

2009

An algorithm for solving the longest increasing circular subsequence problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

A hybrid algorithm for the longest common transposition-invariant subsequence problem.

[BibT_eX]

[DOI]

Comput. Informatics, 2009

On Two Variants of the Longest Increasing Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions, 2009

Computing the Longest Common Transposition-Invariant Subsequence with GPU.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions, 2009

2006

Speeding up transposition-invariant string matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

2005

Revisiting dictionary-based compression.

[BibT_eX]

[DOI]

Przemyslaw Skibinski

Softw. Pract. Exp., 2005

Context exhumation after the Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2002

Second step algorithms in the Burrows-Wheeler compression algorithm.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2002

2001

How to squeeze a lexicon.

[BibT_eX]

[DOI]

Marcin Ciura

Softw. Pract. Exp., 2001

2000

Improvements to Burrows-Wheeler compression algorithm.

[BibT_eX]

[DOI]