Sebastian Deorowicz

According to our database1, Sebastian Deorowicz authored at least 57 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
CoMSA: compression of protein multiple sequence alignment files.
Bioinform., 2019

Kmer-db: instant evolutionary distance estimation.
Bioinform., 2019

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

GTShark: genotype compression in large projects.
Bioinform., 2019

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

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

2017
Even better correction of genome sequencing data.
CoRR, 2017

KMC 3: counting and manipulating k-mer statistics.
Bioinform., 2017

RECKONER: read error corrector based on KMC.
Bioinform., 2017

Even Faster Sorting of (Not Only) Integers.
Proceedings of the Man-Machine Interactions 5, 2017

Improvements in DNA Reads Correction.
Proceedings of the Man-Machine Interactions 5, 2017

Sorting Data on Ultra-Large Scale with RADULS - New Incarnation of Radix Sort.
Proceedings of the Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation, 2017

FM-index for Dummies.
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.
CoRR, 2016

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

2015
Indexing arbitrary-length k-mers in sequencing reads.
CoRR, 2015

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

GDC 2: Compression of large collections of genomes.
CoRR, 2015

Disk-based compression of data from genome sequencing.
Bioinform., 2015

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

2014
Efficient algorithms for the longest common subsequence in k-length substrings.
Inf. Process. Lett., 2014

Disk-based genome sequencing data compression.
CoRR, 2014

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

Indexing large genome collections on a PC.
CoRR, 2014

DSRC 2 - Industry-oriented compression of FASTQ files.
Bioinform., 2014

An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures.
Proceedings of the Beyond Databases, Architectures, and Structures, 2014

An Improved Algorithm for Fast and Accurate Classification of Sequences.
Proceedings of the Beyond Databases, Architectures, and Structures, 2014

2013
Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem.
Int. J. Found. Comput. Sci., 2013

Disk-based k-mer counting on a PC.
BMC Bioinform., 2013

Genome compression: a novel approach for large collections.
Bioinform., 2013

Data compression for sequencing data.
Algorithms Mol. Biol., 2013

Fast and Simple Circular Pattern Matching.
Proceedings of the Man-Machine Interactions 3, 2013

Subcubic Algorithms for the Sequence Excluded LCS Problem.
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.
Proceedings of the Man-Machine Interactions 3, 2013

Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem.
Proceedings of the Man-Machine Interactions 3, 2013

2012
miRNEST database: an integrative approach in microRNA search and annotation.
Nucleic Acids Res., 2012

Quadratic-time algorithm for a string constrained LCS problem.
Inf. Process. Lett., 2012

A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem Designed for GPUs.
Int. J. Found. Comput. Sci., 2012

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

2011
Engineering Relative Compression of Genomes
CoRR, 2011

Robust relative compression of genomes with random access.
Bioinform., 2011

Compression of DNA sequence reads in FASTQ format.
Bioinform., 2011

Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks.
Proceedings of the Man-Machine Interactions 2, 2011

A Parallel GPU-Designed Algorithm for the Constrained Multiple Sequence Alignment Problem.
Proceedings of the Man-Machine Interactions 2, 2011

2010
Solving longest common subsequence and related problems on graphical processing units.
Softw. Pract. Exp., 2010

Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem.
Fundam. Informaticae, 2010

Constrained Longest Common Subsequence Computing Algorithms in Practice.
Comput. Informatics, 2010

2009
An algorithm for solving the longest increasing circular subsequence problem.
Inf. Process. Lett., 2009

A hybrid algorithm for the longest common transposition-invariant subsequence problem.
Comput. Informatics, 2009

On Two Variants of the Longest Increasing Subsequence Problem.
Proceedings of the Man-Machine Interactions, 2009

Computing the Longest Common Transposition-Invariant Subsequence with GPU.
Proceedings of the Man-Machine Interactions, 2009

2006
Speeding up transposition-invariant string matching.
Inf. Process. Lett., 2006

2005
Revisiting dictionary-based compression.
Softw. Pract. Exp., 2005

Context exhumation after the Burrows-Wheeler transform.
Inf. Process. Lett., 2005

2002
Second step algorithms in the Burrows-Wheeler compression algorithm.
Softw. Pract. Exp., 2002

2001
How to squeeze a lexicon.
Softw. Pract. Exp., 2001

2000
Improvements to Burrows-Wheeler compression algorithm.
Softw. Pract. Exp., 2000


  Loading...