Niccolò Cardente

Niccolò Cardente

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 December 2025 in bioRxiv
Verified
Preprint
Open access
MFMarina Frolenkova
Marina Frolenkova
NCNiccolò Cardente
Niccolò Cardente
JZJahn Zhong
Jahn Zhong
EEEvgenii Egorov
Evgenii Egorov
GIGiulio Isacchini
Giulio Isacchini
VGVictor Greiff
Victor Greiff
The adaptive immune receptor repertoire (AIRR) encompasses an immense diversity of antibody and T-cell receptor sequences, whose collective organization − how receptors are distributed, clustered, and interrelated across sequence and functional (e.g., antigen-binding) dimensions − remains poorly characterized. Representing AIRRs in continuous representation spaces that capture sequence, biochemical, and structural similarity between receptors may enable comparisons beyond discrete sequence features. Using both one-hot encodings and protein language model (PLM) embeddings, we developed a quantitative framework to map immune receptor organization at global (sequence-set-level) and local (single-sequence-level) scales. Applying the geometry-aware Wasserstein-2 distance, we show that the global structure of the AIRR space can be recovered from as few as ~105 sequence embeddings, at least 10 orders of magnitude smaller than the theoretical immune receptor diversity. We found that immune receptor sequences annotated with different antigen specificities occupy distinct regions of representation space. To resolve local relationships, we introduce a spatial homogeneity metric that quantifies the extent of functional clustering. We found higher spatial homogeneity in embedding spaces than in sequence space for diverse antigen-specific datasets. Our framework establishes a foundation for quantitative mapping of adaptive immune repertoire organization.

18 March 2026 in Antibodies
Verified
Journal Article
Open access
PDF file
DBDavide Bagnara
Davide Bagnara
AMAndrea N. Mazzarello
Andrea N. Mazzarello
MCMonica Colombo
Monica Colombo
ENEnnio Nano
Ennio Nano
NCNiccolò Cardente
Niccolò Cardente
FFFranco Fais
Franco Fais
Background/Objectives: The immunoglobulin heavy-chain variable (IGHV) gene repertoire represents a characteristic feature of chronic lymphocytic leukemia (CLL), although its configuration is not well defined at the early disease stages. The IGHV repertoire of a cohort of early CLL patients was analyzed and compared to that of a “real-world” reference cohort. Methods: Patients from the O-CLL1 observational protocol, which enrolled only Binet stage A cases within twelve months from diagnosis, were studied. IGHV/IGHJ rearrangements were sequenced and annotated following ERIC recommendations, and stereotyped subsets were assigned using ARResT/AssignSubsets. The repertoire features were compared with the dataset of a real-world cohort of patients with heterogeneous staging (CTR cohort) and with published early-diagnosis series. Results: IGHV and IGHJ gene distributions and HCDR3-length profiles in O-CLL1 closely mirrored those of CTR, indicating that the BcR IG repertoire at diagnosis is already defined rather than being selected during disease progression. Mutated IGHV (M-CLL) predominated, with a frequency of stereotyped BcR IG comparable to that of other early-diagnosis cohorts. However, within this conserved framework, subset #4 was over-represented among M-CLL from O-CLL without an increased overall IGHV4-34 gene usage, suggestive of a selective expansion rather than a recombinational bias. Subset #4 cases retained canonical HCDR3 motifs and showed time-to-first-treatment like other M-CLL, likely reflecting the younger age structure of O-CLL1. Conclusions: Early-diagnosis CLL displays a biased IGHV repertoire with stereotyped configurations characteristic of CLL, including subsets that are rare in the normal B-cell repertoire. These findings support a central role for antigen-driven selection in shaping CLL evolution.

11 June 2026 in bioRxiv
Verified
Preprint
Open access
PDF file
Puneet RawatPuneet Rawat
Puneet Rawat
PRPrabakaran Ramakrishnan
Prabakaran Ramakrishnan
NCNiccolò Cardente
Niccolò Cardente
SKSandeep Kumar
Sandeep Kumar
VGVictor Greiff
Victor Greiff
Michael GromihaMichael Gromiha
Michael Gromiha
Protein aggregation is central to amyloid-related disorders and remains a major developability challenge for protein therapeutics. Over the past two decades, significant advances have been made to predict aggregation-prone regions (APRs) and estimate aggregation propensity in proteins and peptides. In contrast, the prediction of aggregation kinetics has received relatively less attention due to the limited availability and heterogeneity of experimental data. Consequently, aggregation propensities from APR prediction algorithms were widely accepted as a means to predict relative changes in the aggregation kinetics of proteins and mutants. Previous studies have demonstrated, using large-scale datasets, that aggregation propensity shows a weak or inconsistent correlation with aggregation kinetics. In the present study, we have integrated complementary state-of-the-art mechanistic and kinetic prediction tools for protein aggregation into a unified, user-friendly web framework entitled "Amylo-Pipe". Amylo-Pipe also implements practical features that are especially useful for protein engineering, such as gatekeeper-residue mutational scanning to support the design of aggregation-resistant variants. By consolidating multiple prediction tasks in a single interface, Amylo-Pipe enables a more comprehensive assessment of aggregation behavior than APR-only workflows. The web server is freely accessible at: https://web.iitm.ac.in/bioinfo2/amylopipe/.

14 October 2025 in bioRxiv
Verified
Preprint
Open access
JZJahn Zhong
Jahn Zhong
NCNiccolò Cardente
Niccolò Cardente
GSGeir Kjetil Sandve
Geir Kjetil Sandve
HBHabib Bashour
Habib Bashour
MAMaria Francesca Abbate
Maria Francesca Abbate
VGVictor Greiff
Victor Greiff
Motivation: Protein language models (PLMs) capture intricate amino-acid dependencies, producing embeddings that encode rich structural, functional, and evolutionary information. Despite their potential, current extraction workflows rely on arbitrary choices, with respect to embedding layer, pooling, and padding, that frequently yield suboptimal representations for feature extraction and downstream analyses. Large-scale embedding generation is further limited by inefficiencies in computation and memory: (i) accumulating all model outputs in memory before writing to disk causes severe bottlenecks, and (ii) repeatedly embedding identical sequences to extract different modes introduces redundant computation and drastically reduces throughput and scalability. Results: We introduce PEPE (Parallel Extraction for Protein Embeddings), a command-line tool and Python library that enables efficient, high-throughput, and multimodal extraction from protein language models. PEPE’s parallelized and streaming-based architecture achieves runtimes several orders of magnitude faster than sequential approaches. Unlike conventional methods—whose peak memory usage scales linearly with output size and fails when memory capacity is exceeded—PEPE maintains stable, low memory consumption, enabling multimodal embedding extraction even beyond available RAM. PEPE supports a wide range of state-of-the-art and custom PLMs through a simple, flexible interface. By combining scalability, robustness, and ease of use, PEPE allows researchers to generate massive, information-rich embedding datasets efficiently, and facilitate the discovery of optimal representations for structural, functional, and evolutionary downstream tasks. By streamlining the generation of diverse embedding configurations, PEPE provides researchers with the necessary data to identify high-performing latent states for specific biological contexts without requiring additional computational resources. Availability and Implementation: PEPE is a command-line tool written in Python and published under MIT license. The source code and documentation are available at https://github.com/csi-greifflab/pepe-cli . PEPE is also available for installation from PyPI under https://pypi.org/project/pepe-cli and deposited on Zenodo at https://zenodo.org/records/15912054 .

8 March 2026 in bioRxiv
Verified
Preprint
Open access
PDF file
CBChiara Ballerini
Chiara Ballerini
NCNiccolò Cardente
Niccolò Cardente
MAMaria Francesca Abbate
Maria Francesca Abbate
KQKhang Lê Quý
Khang Lê Quý
NRNatalia Rincon
Natalia Rincon
VGVictor Greiff
Victor Greiff
Multiple sclerosis (MS) is a chronic autoimmune disease of the central nervous system (CNS) in which B cells play a critical role. While B-cell receptor (BCR) sequencing studies in MS are increasing, progress in understanding MS-associated BCR repertoire features and convergent patterns across patients has been limited by small cohorts, heterogeneous experimental methodologies, and fragmented data storage. To overcome these challenges, we developed the MS-BCR-Database, the first publicly accessible and uniformly processed collection of human MS BCR sequencing datasets. We harmonized raw BCR-sequencing data into an AIRR-compliant database incorporating clinical and technical metadata, enabling coherent cross-study analyses. Using this resource, we identified putative disease-associated BCR-sequence features, including CNS-biased V-gene usage, marked oligoclonal expansion in cerebrospinal fluid, and convergent clonotype clusters shared exclusively among MS patients. Integration with antigen-annotated BCR databases revealed matches to antibodies recognizing both viral antigens, including Epstein-Barr virus, and CNS self-proteins. The MS-BCR-Database provides a scalable foundation for mechanistic discovery and biomarker development in MS, while establishing a broadly applicable resource for integrative analyses of BCR repertoires.

12 June 2026
Verified
Journal Article
Open access
JZJahn Zhong
Jahn Zhong
NCNiccolò Cardente
Niccolò Cardente
GSGeir Kjetil Sandve
Geir Kjetil Sandve
HBHabib Bashour
Habib Bashour
MAMaria Francesca Abbate
Maria Francesca Abbate
VGVictor Greiff
Victor Greiff
Protein language models (PLMs) capture intricate amino-acid dependencies, producing embeddings that encode rich structural, functional, and evolutionary information. Despite their potential, current extraction workflows rely on arbitrary choices, with respect to embedding layer, pooling, and padding, that frequently yield suboptimal representations for feature extraction and downstream analyses. Large-scale embedding generation is further limited by inefficiencies in computation and memory: (i) accumulating all model outputs in memory before writing to disk causes severe bottlenecks, and (ii) repeatedly embedding identical sequences to extract different modes introduces redundant computation and drastically reduces throughput and scalability. We introduce PEPE (Parallel Extraction for Protein Embeddings), a command-line tool and Python library that enables efficient, high-throughput, and multimodal extraction from protein language models. PEPE's parallelized and streaming-based architecture achieves runtimes several orders of magnitude faster than sequential approaches. Unlike conventional methods-whose peak memory usage scales linearly with output size and fails when memory capacity is exceeded-PEPE maintains stable, low memory consumption, enabling multimodal embedding extraction even beyond available RAM. PEPE supports a wide range of state-of-the-art and custom PLMs through a simple, flexible interface. By combining scalability, robustness, and ease of use, PEPE allows researchers to generate massive, information-rich embedding datasets efficiently, and facilitate the discovery of optimal representations for structural, functional, and evolutionary downstream tasks. By streamlining the generation of diverse embedding configurations, PEPE provides researchers with the necessary data to identify high-performing latent states for specific biological contexts without requiring additional computational resources. PEPE is a command-line tool written in Python and published under MIT license. The source code and documentation are available at https://github.com/csi-greifflab/pepe-cli. PEPE is also available for installation from PyPI under https://pypi.org/project/pepe-cli and deposited on Zenodo at https://zenodo.org/records/15912054. Supplementary data are available at Journal Name online.