Sebastian Deorowicz

Sebastian Deorowicz: A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem. Computing and Informatics 31(6): 1217-1233 (2012)

Adam Gudys, Sebastian Deorowicz: A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem Designed for GPUs. Int. J. Found. Comput. Sci. 23(4): 877-902 (2012)

Sebastian Deorowicz: Quadratic-time algorithm for a string constrained LCS problem. Inf. Process. Lett. 112(11): 423-426 (2012)

Michal Wojciech Szczesniak, Sebastian Deorowicz, Jakub Gapski, Lukasz Kaczynski, Izabela Makalowska: miRNEST database: an integrative approach in microRNA search and annotation. Nucleic Acids Research 40(Database-Issue): 198-204 (2012)

Sebastian Deorowicz, Szymon Grabowski: Compression of DNA sequence reads in FASTQ format. Bioinformatics 27(6): 860-862 (2011)

Sebastian Deorowicz, Szymon Grabowski: Robust relative compression of genomes with random access. Bioinformatics 27(21): 2979-2986 (2011)

Szymon Grabowski, Sebastian Deorowicz: Engineering Relative Compression of Genomes. CoRR abs/1103.2351 (2011)

Sebastian Deorowicz: Quadratic-time Algorithm for the String Constrained LCS Problem. CoRR abs/1106.6342 (2011)

Sebastian Deorowicz, J. Obstoj: Constrained Longest Common Subsequence Computing Algorithms in Practice. Computing and Informatics 29(3): 427-445 (2010)

Sebastian Deorowicz: Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem. Fundam. Inform. 99(4): 409-433 (2010)

Sebastian Deorowicz: Solving longest common subsequence and related problems on graphical processing units. Softw., Pract. Exper. 40(8): 673-700 (2010)

Sebastian Deorowicz, Szymon Grabowski: A hybrid algorithm for the longest common transposition-invariant subsequence problem. Computing and Informatics 28(5): 729-744 (2009)

Sebastian Deorowicz: An algorithm for solving the longest increasing circular subsequence problem. Inf. Process. Lett. 109(12): 630-634 (2009)

Sebastian Deorowicz: Speeding up transposition-invariant string matching. Inf. Process. Lett. 100(1): 14-20 (2006)

Sebastian Deorowicz: Context exhumation after the Burrows-Wheeler transform. Inf. Process. Lett. 95(1): 313-320 (2005)

Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz: Revisiting dictionary-based compression. Softw., Pract. Exper. 35(15): 1455-1476 (2005)

Sebastian Deorowicz: Second step algorithms in the Burrows-Wheeler compression algorithm. Softw., Pract. Exper. 32(2): 99-111 (2002)

Marcin Ciura, Sebastian Deorowicz: How to squeeze a lexicon. Softw., Pract. Exper. 31(11): 1077-1090 (2001)

Sebastian Deorowicz: Improvements to Burrows-Wheeler compression algorithm. Softw., Pract. Exper. 30(13): 1465-1483 (2000)