Biology subjects

Van de Vyver, S.

Publications and source records attributed to Van de Vyver, S..

5 recordsLinked to original sources

bioRxiv2026

Palaeoproteomic deconvolution of physical and genetic collagen mixtures

Species identification in palaeoproteomics relies on genome-derived protein sequences which are often poor-quality, and lacks tools to cope with multi-species samples. Here, we address both challenges through the analysis of physical and genetic mixtures. Species that are absent from our database are considered a genetic mixture, i.e. a patchwork of peptides from closely related species. Inversely, various overlapping peptide stretches allow us to resolve complex physical mixtures. This is benchmarked by analysing physical mixtures of modern bone fragments, including genetic mixtures. We illustrate the impact of our approach via a rapid and high-throughput analysis of >2500 bone fragments, revealing the Eemian-era faunal environment around Scladina Cave, including the first Palaeoloxodon antiquus identified at this site. O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=182 SRC="FIGDIR/small/732552v1_ufig1.gif" ALT="Figure 1"> View larger version (67K): org.highwire.dtl.DTLVardef@a33296org.highwire.dtl.DTLVardef@4e4b85org.highwire.dtl.DTLVardef@402290org.highwire.dtl.DTLVardef@9d35b6_HPS_FORMAT_FIGEXP M_FIG C_FIG

biochemistry↗

bioRxiv2026

Evaluation of Protein Reference Database Reduction and Its Impact on Peptide-Centric Metaproteomics

Metaproteomics identifies the proteins present in a microbial community and, from them, which organisms are active and what functions they carry out. Tools such as Unipept assign peptides to taxa and functions by matching them to UniProtKB proteins and taking the lowest common ancestor of the matching taxa, deriving functional annotations from the same matches. This analysis therefore depends directly on the content of UniProtKB, which was substantially restructured in 2025-2026, reducing it by more than 100 million protein entries. We investigated how these changes affect taxonomic interpretation and how restricting the database to sample-specific taxa identified by rRNA profiling modifies that effect. Fixed, non-redundant peptide lists from human-gut and marine-hatchery studies were reanalysed with Unipept against UniProtKB releases 2025_03, 2025_04, and 2026_02. Peptide mapping coverage fell from 85.9% to 73.3% (gut) and from 82.3% to 68.7% (marine) between release 2025_03 and 2026_02, yet dominant taxonomic profiles remained robust: family- and genus-level distributions changed little and all 15 dominant gut species were retained. Root-level assignments dropped from 18.7% to 7.0% (gut) and 25.8% to 14.3% (marine). Restricting UniProtKB 2026_02 to taxa detected by large-subunit ribosomal RNA (LSU rRNA) profiling reduced coverage to 64.4% (gut) and 41.8% (marine), while genus- and species-level proportions changed by less than one percentage point. The major UniProtKB restructuring of 2025-2026 therefore narrowed mapping breadth without destabilizing the dominant taxonomic profiles in these two datasets.

bioinformatics↗

bioRxiv2025

Direct construction of sparse suffix arrays with Libsais

Pattern matching is a fundamental challenge in bioinformatics, especially in the fields of genomics, transcriptomics and proteomics. Efficient indexing structures, such as suffix arrays, are critical for searching large datasets. While sparse suffix arrays offer significant memory savings compared to full suffix arrays, they typically still require the construction of a full suffix array prior to a sampling step, resulting in substantial memory overhead during the construction phase. We present an alternative method to directly construct the sparse suffix array using a simple, yet powerful text encoding, in combination with the widely used Libsais library. This approach bypasses the need for constructing a full suffix array, reducing memory usage by 63% and construction time by 55% when building a sparse suffix array with sparseness factor 3 for the entire UniProt knowledgebase. The method is particularly effective for applications with small alphabets, such as a nucleotide or amino acid alphabet. An open-source implementation of this method is available on GitHub, enabling easy adoption for large-scale bioinformatics applications.

bioinformatics↗

bioRxiv2024

Unipept 6.0: Expanding metaproteomics analysis with support for missed cleavages, semi-tryptic and non-tryptic peptides

Unipept, a pioneering software tool in metaproteomics, has significantly advanced the analysis of complex ecosystems by facilitating both taxonomic and functional insights from environmental samples. From the onset, Unipepts capabilities focused on tryptic peptides, utilizing the predictability and consistency of trypsin digestion to efficiently construct a protein reference database. However, the evolving landscape of proteomics and emerging fields like immunopeptidomics necessitate a more versatile approach that extends beyond the analysis of tryptic peptides. In this article, we present a significant update to the underlying index structure of Unipept, which is now powered by a Sparse Suffix Array index. This advancement enables the analysis of semi-tryptic peptides, peptides with missed cleavages, and non-tryptic peptides such as those encountered in other research fields such as immunopeptidomics (e.g. MHC- and HLA-peptides). This new index benefits all tools in the Unipept ecosystem such as the web application, desktop tool, API and command line interface. A benchmark study highlights significantly improved performance in handling missed cleavages, preserving the same level of accuracy. For TOC Only O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=200 SRC="FIGDIR/small/615136v2_ufig1.gif" ALT="Figure 1"> View larger version (32K): org.highwire.dtl.DTLVardef@5b8fe2org.highwire.dtl.DTLVardef@1435321org.highwire.dtl.DTLVardef@106a568org.highwire.dtl.DTLVardef@15563e2_HPS_FORMAT_FIGEXP M_FIG C_FIG

bioinformatics↗

bioRxiv2024

b-move: faster bidirectional character extensions in a run-length compressed index

Due to the increasing availability of high-quality genome sequences, pan-genomes are gradually replacing single consensus reference genomes in many bioinformatics pipelines to better capture genetic diversity. Traditional bioinformatics tools using the FM-index face memory limitations with such large genome collections. Recent advancements in run-length compressed indices like Gagie et al.s r-index and Nishimoto and Tabeis move structure, alleviate memory constraints but focus primarily on backward search for MEM-finding. Arakawa et al.s br-index initiates complete approximate pattern matching using bidirectional search in run-length compressed space, but with significant computational overhead due to complex memory access patterns. We introduce b-move, a novel bidirectional extension of the move structure, enabling fast, cache-efficient bidirectional character extensions in run-length compressed space. It achieves bidirectional character extensions up to 8 times faster than the br-index, closing the performance gap with FM-index-based alternatives, while maintaining the br-indexs favorable memory characteristics. For example, all available complete E. coli genomes on NCBIs RefSeq collection can be compiled into a b-move index that fits into the RAM of a typical laptop. Thus, b-move proves practical and scalable for pan-genome indexing and querying. We provide a C++ implementation of b-move, supporting efficient lossless approximate pattern matching including locate functionality, available at https://github.com/biointec/b-move under the AGPL-3.0 license. FundingLore Depuydt: PhD Fellowship FR (1117322N), Research Foundation - Flanders (FWO) Luca Renders: PhD Fellowship SB (1SE7822N), Research Foundation - Flanders (FWO) Travis Gagie: NSERC Discovery Grant RGPIN-07185-2020 to Travis Gagie and NIH grant R01HG011392 to Ben Langmead

bioinformatics↗