Sebastian Deorowicz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sebastian Deorowicz has a total of 161 co-authors. Here are the top co-authors by number of shared publications:
- Marek Kokot
Department of Algorithmics and Software, Silesian University of Technology, Gliwice, Poland
23 shared publications - Adam Gudyś
Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland
21 shared publications - Szymon Grabowski
Institute of Applied Computer Science, Lodz University of Technology, Lodz, Poland
20 shared publications - Agnieszka Danek
Silesian University of Technology
15 shared publications Agnieszka Debudaj-Grabysz
Institute of Informatics, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Akademicka 16, Gliwice, PL, Poland
9 shared publications- Andrzej Zielezinski
Laboratory of Computational Biology, Faculty of Biology, Adam Mickiewicz University, Poznan, Poland
7 shared publications
Latest Publications
- Open Access
Alignment-Free k-mer Analysis Reveals Age-Associated k-mer Signals in Canine Buccal DNA and Cell-Free DNA
Aging is associated with progressive molecular and cellular changes that alter chromatin organization, epigenetic regulation, and microbial community structure. While DNA methylation-based biomarkers have demonstrated age-prediction performance, the potential of alignment-free sequence analysis for detecting age-associated signals remains unexplored. We performed a k-mer-based analysis of whole-genome sequencing datasets from two canine cohorts: 1,187 buccal DNA samples and 100 cell-free DNA (cfDNA) samples. Age-associated k-mers were identified through correlation analysis, and sequence motifs and nucleotide composition patterns were characterized across both sample types. Ridge regression models were used to predict age from k-mer frequency profiles, and synthetic datasets were generated under biological compositional assumptions to evaluate potential drivers of the observed signals. Age-associated k-mer signals were identified in both buccal DNA and cfDNA, with substantially stronger patterns observed in buccal samples. Buccal-derived k-mers exhibited more pronounced motif patterns, stronger GC and AT enrichment trends, and improved age-prediction performance relative to cfDNA. Nucleotide enrichment trends differed between sample types, suggesting that distinct biological processes may contribute to age-associated sequence composition changes in buccal DNA and cfDNA. Simulation analyses successfully reproduced major enrichment trends observed empirically, and age-associated signals were largely preserved following restriction to read-start sequence composition. These findings demonstrate that alignment-free k-mer analysis can detect age-associated sequence composition signals in canine DNA and highlight its potential as a computationally efficient complementary approach for aging biomarker discovery.
Open AccessAlignment-Free k-mer Analysis Reveals Age-Associated k-mer Signals in Canine Buccal DNA and Cell-Free DNA
Aging is associated with progressive molecular and cellular changes that alter chromatin organization, epigenetic regulation, and microbial community structure. While DNA methylation-based biomarkers have demonstrated age-prediction performance, the potential of alignment-free sequence analysis for detecting age-associated signals remains unexplored. We performed a k-mer-based analysis of whole-genome sequencing datasets from two canine cohorts: 1,187 buccal DNA samples and 100 cell-free DNA (cfDNA) samples. Age-associated k-mers were identified through correlation analysis, and sequence motifs and nucleotide composition patterns were characterized across both sample types. Ridge regression models were used to predict age from k-mer frequency profiles, and synthetic datasets were generated under biological compositional assumptions to evaluate potential drivers of the observed signals. Age-associated k-mer signals were identified in both buccal DNA and cfDNA, with substantially stronger patterns observed in buccal samples. Buccal-derived k-mers exhibited more pronounced motif patterns, stronger GC and AT enrichment trends, and improved age-prediction performance relative to cfDNA. Nucleotide enrichment trends differed between sample types, suggesting that distinct biological processes may contribute to age-associated sequence composition changes in buccal DNA and cfDNA. Simulation analyses successfully reproduced major enrichment trends observed empirically, and age-associated signals were largely preserved following restriction to read-start sequence composition. These findings demonstrate that alignment-free k-mer analysis can detect age-associated sequence composition signals in canine DNA and highlight its potential as a computationally efficient complementary approach for aging biomarker discovery.
- Open Access
MKMC enables reference-free transcriptomic analysis using k-mer representations
Traditional RNA-seq analysis depends heavily on genome alignment and gene annotation, limiting its utility in non-model organisms and introducing biases that can obscure regulatory complexity. We present MKMC (Multi-sample Kmer Counter), a scalable, reference-free toolkit for RNA-seq analysis that leverages k-mer-based statistics to detect biological variation without requiring alignment. MKMC integrates fast k-mer counting, abundance matrix generation, normalization, dimensionality reduction, and differential analysis into a unified workflow. Across diverse datasets, MKMC recapitulates key biological signals, including sex differences in killifish liver, and matches alignment-based pipelines in differential expression analysis and transcriptomic age prediction. Notably, MKMC detects isoform-specific events missed by traditional methods, one of which we validated using in situ hybridization. These results reveal previously hidden isoform-level regulatory events that contribute to sex- and age-associated transcriptional programs. MKMC offers a robust, extensible alternative to alignment-based approaches, enabling transcriptomic discovery across both model and non-model systems. While we focus here on RNA-seq as a primary application, MKMC is broadly applicable to any k-mer-based analysis of next-generation sequencing data.
Open AccessMKMC enables reference-free transcriptomic analysis using k-mer representations
Traditional RNA-seq analysis depends heavily on genome alignment and gene annotation, limiting its utility in non-model organisms and introducing biases that can obscure regulatory complexity. We present MKMC (Multi-sample Kmer Counter), a scalable, reference-free toolkit for RNA-seq analysis that leverages k-mer-based statistics to detect biological variation without requiring alignment. MKMC integrates fast k-mer counting, abundance matrix generation, normalization, dimensionality reduction, and differential analysis into a unified workflow. Across diverse datasets, MKMC recapitulates key biological signals, including sex differences in killifish liver, and matches alignment-based pipelines in differential expression analysis and transcriptomic age prediction. Notably, MKMC detects isoform-specific events missed by traditional methods, one of which we validated using in situ hybridization. These results reveal previously hidden isoform-level regulatory events that contribute to sex- and age-associated transcriptional programs. MKMC offers a robust, extensible alternative to alignment-based approaches, enabling transcriptomic discovery across both model and non-model systems. While we focus here on RNA-seq as a primary application, MKMC is broadly applicable to any k-mer-based analysis of next-generation sequencing data.
- Open Access
First community challenge for automated virus taxonomy
The rapid rate of virus discovery renders manual curation by taxonomy experts increasingly impractical, creating a need for reliable software that can reproducibly assign viral contigs to taxa at all fifteen ranks of the virus taxonomy. We led an open community challenge for the computational taxonomic classification of viruses and assembled a dataset of virus sequences combining expert-curated and metagenomic sequences. Seventeen teams contributed a total of thirty-four automated, fully reproducible classification pipelines. Most tools correctly assigned viruses belonging to established species, genera, or families, but viruses that are unclassified at those lower ranks remain challenging. This study provides datasets, open-source software, novel approaches, and recommendations to benchmark computational taxonomic classification of viruses, and support organizing the many viruses discovered in big omics data.
Open AccessFirst community challenge for automated virus taxonomy
The rapid rate of virus discovery renders manual curation by taxonomy experts increasingly impractical, creating a need for reliable software that can reproducibly assign viral contigs to taxa at all fifteen ranks of the virus taxonomy. We led an open community challenge for the computational taxonomic classification of viruses and assembled a dataset of virus sequences combining expert-curated and metagenomic sequences. Seventeen teams contributed a total of thirty-four automated, fully reproducible classification pipelines. Most tools correctly assigned viruses belonging to established species, genera, or families, but viruses that are unclassified at those lower ranks remain challenging. This study provides datasets, open-source software, novel approaches, and recommendations to benchmark computational taxonomic classification of viruses, and support organizing the many viruses discovered in big omics data.
- 22 April 2026
- Published by Springer Nature in Nature Biotechnology
- p. 1-6
Reference-free discovery with barcoded single-cell sequencing
Single-cell RNA sequencing (scRNA-seq) analyses typically focus on alignment and differential gene expression, being blind to other transcriptome variation. Here we present sc-SPLASH for statistics-first, reference-free discovery on barcoded scRNA-seq and spatial transcriptomics; its independent BKC submodule optimizes barcoded data preprocessing and is approximately 50-fold faster than UMI-tools. sc-SPLASH discovers secreted repeat proteins in immune-like cells of sponge (Spongilla; missing from the reference) and tunicate (Ciona).
- 22 April 2026
- Published by Springer Nature in Nature Biotechnology
- p. 1-6
Reference-free discovery with barcoded single-cell sequencing
Single-cell RNA sequencing (scRNA-seq) analyses typically focus on alignment and differential gene expression, being blind to other transcriptome variation. Here we present sc-SPLASH for statistics-first, reference-free discovery on barcoded scRNA-seq and spatial transcriptomics; its independent BKC submodule optimizes barcoded data preprocessing and is approximately 50-fold faster than UMI-tools. sc-SPLASH discovers secreted repeat proteins in immune-like cells of sponge (Spongilla; missing from the reference) and tunicate (Ciona).
- 14 April 2026
- Published by Springer Nature in Nature Biotechnology
Fast and accurate multiple-protein-sequence alignment at scale with FAMSA2
We introduce FAMSA2, an algorithm that produces high-accuracy multiple-protein-sequence alignments at high speed. Across structural, phylogenetic and functional benchmarks, FAMSA2 matches or exceeds the accuracy of state-of-the-art tools while running 400 times faster on average than existing aligners. By combining progressive alignment with medoid clustering-based guide tree construction and a dissimilarity measure derived from the longest common subsequence, it enables scalable alignment of massive protein families.
- 14 April 2026
- Published by Springer Nature in Nature Biotechnology
Fast and accurate multiple-protein-sequence alignment at scale with FAMSA2
We introduce FAMSA2, an algorithm that produces high-accuracy multiple-protein-sequence alignments at high speed. Across structural, phylogenetic and functional benchmarks, FAMSA2 matches or exceeds the accuracy of state-of-the-art tools while running 400 times faster on average than existing aligners. By combining progressive alignment with medoid clustering-based guide tree construction and a dissimilarity measure derived from the longest common subsequence, it enables scalable alignment of massive protein families.
- Open Access
- 9 April 2026
- Published by Wiley in Plant Direct
- Vol. 10 (4)
A Reference‐Free Algorithm Discovers Regulation in the Plant Transcriptome
Most plant genomes and their (post‐)transcriptional regulation remain unknown. We used SPLASH—a new, reference genome‐free sequence variation detection algorithm—to analyze transcriptional and post‐transcriptional regulation from RNA‐seq data. We discovered allelic variation in expression during maize pollen development and imbibition‐dependent cryptic splicing in Arabidopsis seeds. SPLASH enables discovery of novel regulatory mechanisms, including differential regulation of genes from parental haplotypes of hybrids, without the use of alignment to a reference genome.
- 9 April 2026
- Published by Wiley in Plant Direct
- Vol. 10 (4)
Open AccessA Reference‐Free Algorithm Discovers Regulation in the Plant Transcriptome
Most plant genomes and their (post‐)transcriptional regulation remain unknown. We used SPLASH—a new, reference genome‐free sequence variation detection algorithm—to analyze transcriptional and post‐transcriptional regulation from RNA‐seq data. We discovered allelic variation in expression during maize pollen development and imbibition‐dependent cryptic splicing in Arabidopsis seeds. SPLASH enables discovery of novel regulatory mechanisms, including differential regulation of genes from parental haplotypes of hybrids, without the use of alignment to a reference genome.
- Open Access
- 7 April 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (4)
MDCompress: better, faster compression of molecular dynamics simulation trajectories
Motivation: Molecular dynamics (MD) simulations model the physical movements of atoms in biomolecular systems over time, providing atomic-resolution insight into conformational changes, binding events, and dynamic behaviors that cannot be captured by static structures alone. As such, MD simulations are playing an increasingly important role in understanding the functional roles and molecular interactions of proteins. However, trajectories from these simulations can be extremely large, often reaching tens of gigabytes for a single simulation of modest duration. This creates substantial challenges for storage and data transfer, motivating efficient compression strategies. Furthermore, many downstream analyses require extraction of only a subset of frames or specific atoms from the full trajectory, so an ideal compression format should support rapid random-access decompression of such samplings without requiring full file decompression. Results: Here, we introduce MDCompress, a new trajectory compression format and accompanying software implementation that meets these goals. MDCompress produces compressed trajectory files that are 15–37% smaller than those generated by the widely-used XTC format, while achieving faster compression and decompression speeds through efficient multithreading. Availability and implementation: The MDCompress software and library are released under an open license (BSD-3) and may be downloaded at https://github.com/refresh-bio/mdcompress and is also available as a Zenodo repository at 10.5281/zenodo.19218347
- 7 April 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (4)
Open AccessMDCompress: better, faster compression of molecular dynamics simulation trajectories
Motivation: Molecular dynamics (MD) simulations model the physical movements of atoms in biomolecular systems over time, providing atomic-resolution insight into conformational changes, binding events, and dynamic behaviors that cannot be captured by static structures alone. As such, MD simulations are playing an increasingly important role in understanding the functional roles and molecular interactions of proteins. However, trajectories from these simulations can be extremely large, often reaching tens of gigabytes for a single simulation of modest duration. This creates substantial challenges for storage and data transfer, motivating efficient compression strategies. Furthermore, many downstream analyses require extraction of only a subset of frames or specific atoms from the full trajectory, so an ideal compression format should support rapid random-access decompression of such samplings without requiring full file decompression. Results: Here, we introduce MDCompress, a new trajectory compression format and accompanying software implementation that meets these goals. MDCompress produces compressed trajectory files that are 15–37% smaller than those generated by the widely-used XTC format, while achieving faster compression and decompression speeds through efficient multithreading. Availability and implementation: The MDCompress software and library are released under an open license (BSD-3) and may be downloaded at https://github.com/refresh-bio/mdcompress and is also available as a Zenodo repository at 10.5281/zenodo.19218347
- Open Access
FunctionaL Assigning Sequence Homing (FLASH) maps phenotype to sequence with deep and machine learning
Genome-wide association studies (GWAS) map genetic variation to a reference genome and correlate variants to phenotypes. Yet, GWAS and similar procedures have limitations, including an inability to predict phenotype on variants never seen during the discovery phase and difficulty integrating structural variants. Deep and machine learning alternatives have not been successful at consistent prediction of resistance phenotypes (Hu et al. 2024). Here, we introduce FLASH: a new interpretable, statistically-based deep learning framework that operates directly on raw sequencing reads. In over 35,000 isolates of bacteria, fungi and viruses, FLASH achieves uniformly high accuracy on independent test data, including on variation never seen in training, meeting or exceeding bespoke state of the art methods. FLASH identifies canonical drug targets ab initio and new pan-species predictors of virulence, including those lacking annotation and those only partially aligned to NCBI reference databases. Further, FLASH can predict phenotypes beyond the possibility of GWAS, such as bacterial host range of phage, a task that to our knowledge is impossible today. FLASH is simple to run, highly efficient and constitutes a new approach for predicting gene function and phenotype across the tree of life. It is especially valuable when bioethical concerns and the vast genetic complexity of pathogenic microbes limit the feasibility of experimental validation.
Open AccessFunctionaL Assigning Sequence Homing (FLASH) maps phenotype to sequence with deep and machine learning
Genome-wide association studies (GWAS) map genetic variation to a reference genome and correlate variants to phenotypes. Yet, GWAS and similar procedures have limitations, including an inability to predict phenotype on variants never seen during the discovery phase and difficulty integrating structural variants. Deep and machine learning alternatives have not been successful at consistent prediction of resistance phenotypes (Hu et al. 2024). Here, we introduce FLASH: a new interpretable, statistically-based deep learning framework that operates directly on raw sequencing reads. In over 35,000 isolates of bacteria, fungi and viruses, FLASH achieves uniformly high accuracy on independent test data, including on variation never seen in training, meeting or exceeding bespoke state of the art methods. FLASH identifies canonical drug targets ab initio and new pan-species predictors of virulence, including those lacking annotation and those only partially aligned to NCBI reference databases. Further, FLASH can predict phenotypes beyond the possibility of GWAS, such as bacterial host range of phage, a task that to our knowledge is impossible today. FLASH is simple to run, highly efficient and constitutes a new approach for predicting gene function and phenotype across the tree of life. It is especially valuable when bioethical concerns and the vast genetic complexity of pathogenic microbes limit the feasibility of experimental validation.
- Open Access
MDCompress: better, faster compression of molecular dynamics simulation trajectories
Motivation: Molecular dynamics (MD) simulations model the physical movements of atoms in biomolecular systems over time, providing atomic-resolution insight into conformational changes, binding events, and dynamic behaviors that cannot be captured by static structures alone. As such, MD simulations are playing an increasingly important role in understanding the functional roles and molecular interactions of proteins. However, trajectories from these simulations can be extremely large, often reaching tens of gigabytes for a single simulation of modest duration. This creates substantial challenges for storage and data transfer, motivating efficient compression strategies. Furthermore, many downstream analyses require extraction of only a subset of frames or specific atoms from the full trajectory, so an ideal compression format should support rapid random-access decompression of such samplings without requiring full file decompression. Results: Here, we introduce MDCompress, a new trajectory compression format and accompanying software implementation that meets these goals. MDCompress produces compressed trajectory files that are 15–37% smaller than those generated by the widely-used XTC format, while achieving faster compression and decompression speeds through efficient multithreading. Availability and Implementation: The MDCompress software and library are released under an open license (BSD-3) and may be downloaded at https://github.com/refresh-bio/mdcompress Contact: twheeler@arizona.edu , sebastian.deorowicz@polsl.pl Supplementary information: Supplementary data are available online.
Open AccessMDCompress: better, faster compression of molecular dynamics simulation trajectories
Motivation: Molecular dynamics (MD) simulations model the physical movements of atoms in biomolecular systems over time, providing atomic-resolution insight into conformational changes, binding events, and dynamic behaviors that cannot be captured by static structures alone. As such, MD simulations are playing an increasingly important role in understanding the functional roles and molecular interactions of proteins. However, trajectories from these simulations can be extremely large, often reaching tens of gigabytes for a single simulation of modest duration. This creates substantial challenges for storage and data transfer, motivating efficient compression strategies. Furthermore, many downstream analyses require extraction of only a subset of frames or specific atoms from the full trajectory, so an ideal compression format should support rapid random-access decompression of such samplings without requiring full file decompression. Results: Here, we introduce MDCompress, a new trajectory compression format and accompanying software implementation that meets these goals. MDCompress produces compressed trajectory files that are 15–37% smaller than those generated by the widely-used XTC format, while achieving faster compression and decompression speeds through efficient multithreading. Availability and Implementation: The MDCompress software and library are released under an open license (BSD-3) and may be downloaded at https://github.com/refresh-bio/mdcompress Contact: twheeler@arizona.edu , sebastian.deorowicz@polsl.pl Supplementary information: Supplementary data are available online.
- Open Access
FAMSA2 enables accurate multiple sequence alignment at protein-universe scale
We introduce FAMSA2, an algorithm that produces high-accuracy multiple protein sequence alignments with unprecedented speed. Across structural, phylogenetic, and functional benchmarks, FAMSA2 matches or exceeds the accuracy of state-of-the-art tools while running up to 400 times faster and outperforming the fastest existing aligners. The ability of FAMSA2 to process 12 million sequences in 40 minutes on a 64 GB RAM workstation enables evolutionary and structural analyses at previously unattainable scales.
Open AccessFAMSA2 enables accurate multiple sequence alignment at protein-universe scale
We introduce FAMSA2, an algorithm that produces high-accuracy multiple protein sequence alignments with unprecedented speed. Across structural, phylogenetic, and functional benchmarks, FAMSA2 matches or exceeds the accuracy of state-of-the-art tools while running up to 400 times faster and outperforming the fastest existing aligners. The ability of FAMSA2 to process 12 million sequences in 40 minutes on a 64 GB RAM workstation enables evolutionary and structural analyses at previously unattainable scales.