Skip to content

Zipf-like Statistical Regularities in Molecular Sequence Representations for Chemical Language Models.

Aug 2026 · Journal of Physical Chemistry Letters · Vol 17 34, pp. 9807-9814 · 0 citations · 41 references
Medicine

TL;DR

Analysis of rank-frequency distributions of tokens derived by byte-pair encoding (BPE) across large molecular databases shows that molecular BPE vocabularies exhibit an approximate Zipf-like rank-frequency regularity and that slope closeness provides an empirical diagnostic for comparing vocabulary sizes within the examined SMILES/SELFIES BPE framework.

Abstract

Large language model (LLM)-based approaches increasingly use molecular strings such as SMILES and SELFIES for molecular generation and property prediction. However, the statistical properties of molecular token distributions have not been systematically characterized. Here, we analyzed rank-frequency distributions of tokens derived by byte-pair encoding (BPE) across large molecular databases. BPE-derived tokens showed approximate Zipf-like rank-frequency scaling across the examined representations and chemical spaces, with fitted slopes moderately steeper than the canonical value of -1, paralleling a statistical pattern widely observed in natural language. Moreover, when BERT models were pretrained using BPE vocabularies with different rank-frequency slopes, the closeness of these slopes to the ideal Zipf value of -1 strongly correlated with performance on molecular property prediction tasks (Pearson r = 0.91, p < 0.001) and remained associated after adjustment for vocabulary size (partial r = 0.86, p < 0.001). Together, these findings show that molecular BPE vocabularies exhibit an approximate Zipf-like rank-frequency regularity and that slope closeness provides an empirical diagnostic for comparing vocabulary sizes within the examined SMILES/SELFIES BPE framework.

View source

Similar papers

#machine learning Preprint Sep 2026

LEMON-ZEST: Evolution-Informed Tokenization for Efficient Protein Language Modeling

This work introduces ZEST (Zoned Encoding of Sequence Traits), an evolution-informed vocabulary derived from conserved regions of multiple sequence alignments that demonstrates that evolution-informed tokenization can substitute for massive parameter scaling, opening a new direction for efficient, biologically-grounded...

Biswajit Banerjee, Claudia A. Carreno, Anton S. Petrov · 0 citations
Open access Aug 2026

Sparse Autoencoders Reveal Structural and Family-level Features in BiRNA-BERT

SPIRAL is presented, a layer-wise SAE analysis of BiRNA-BERT, a layer-wise SAE analysis of RNA language models where byte-pair tokenization breaks the one-token-one-nucleotide correspondence that nucleotide-level attribution assumes.

M. Hossain, MD. Roqunuzzaman Sojib, Md Toki Tahmid et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ProtLingo: Efficient Protein Language Modeling via Conditional Memory and Expert Routing

ProtLingo, an efficient PLM framework that augments a pretrained single-sequence backbone with conditional local memory and sparse expert routing, achieves competitive performance with a 150M-scale backbone, including strong parameter efficiency on mutation-effect prediction and preserved long-range structural represen...

Ming-Rui Li, Si-Xian Shen, Min-Zhang Li et al. · 0 citations
#machine learning Preprint Aug 2026

Task- and dataset-specific information in protein language models

Protein language models (PLMs) have transferred the latest advances from natural language processing to computational biology. These models, trained on large corpora of protein sequence data, are widely used to translate amino acid sequences into latent-space embeddings, ready for use in diverse downstream tasks (DTs)....

R. Joeres, Ilya S. Senatorov, A. Kolchina et al. · 0 citations
Open access Aug 2026

Comparative Benchmarking of Probabilistic, Recurrent, and Self-Attention Models for Autoregressive Genomic Sequence Modeling

This work provides a resource-efficiency analysis and empirical benchmark for model selection in constrained genomic modeling tasks, highlighting that computationally expensive deep learning architectures do not unconditionally outperform lightweight statistical baselines on small, vocabulary-constrained genomic datase...

J. Vijaya, Harshvardhan Sharma, Avani Gajallewar et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.