Motif-Vocab is a biologically informed tokenizer that scans both DNA strands for statistically calibrated motif matches, emits transcription-factor (TF) identity tokens, and applies nucleotide, $k$-mer, or byte-pair encoding (BPE) to unmatched sequence.
Abstract
Tokenization is a central design choice in genomic language models, yet most deoxyribonucleic acid (DNA) tokenizers use characters, fixed-length k-mers, or frequency-derived subwords without explicitly using prior information about the specificity of DNA-binding regulatory factors. We introduce Motif-Vocab, a biologically informed tokenizer that scans both DNA strands for statistically calibrated motif matches, emits transcription-factor (TF) identity tokens, and applies nucleotide, $k$-mer, or byte-pair encoding (BPE) to unmatched sequence. Motif-specific null distributions put position-weight matrices (PWMs) of different lengths and degeneracy on a common significance scale; deterministic overlap rules make the representation reproducible. In controlled Bidirectional Encoder Representations from Transformers (BERT) pretraining on two billion base pairs, real motif libraries outperform randomized-motif controls on 54 of 55 in-scope downstream tasks. On a motif-disjoint recognition task derived from DART-Eval Task 2, TF-specific tokens improve macro-F1 by 0.040 over a position-matched generic motif token and by 0.033 over a matched no-motif tokenizer (95\% bootstrap confidence interval: 0.027--0.038). Motif tokens also receive stronger attribution and produce larger occlusion effects than shuffled controls. Dense no-motif tokenizers remain strong general-purpose baselines, including a near-tie on the five-task BERT-base panel. Thus, Motif-Vocab is not a universal accuracy replacement; it is a targeted, interpretable inductive bias for motif-sensitive genomic modeling.
Decoder DNA foundation models pretrain with dense next-token prediction and scale to long sequences, but their representations are directional. This is a poor fit for genomic tasks that need sequence context both upstream and downstream of a locus. Bidirectional masked-language-model encoders supply this context, but t...
Yuan Liang, Ke Zhai, Yu-Jian Gan et al.· bioRxiv· 0 citations
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
Current genomic foundation models (GFMs) largely inherit the language-modeling paradigm over contiguous token sequences, treating DNA as ordinary text. The genome, however, is a coordinate-based system of sparse signals: the entities that matter, such as individual variants, regulatory elements, and distal gene interac...
Xu Yang, Chen-Chen Qin, Fang Wang et al.· bioRxiv· 0 citations
Protein sequence, structure, and functional annotations each capture complementary aspects of protein biology, yet existing tokenizers encode each modality independently, limiting the expressiveness of discrete protein representations. We present ProTok, a unified protein tokenizer that maps all three modalities into a...
Romain Hardy, Xiao-Man Zhang, P. Rajpurkar· 0 citations
Autoregressive transformers remain comparatively weak for protein sequence and structure generation. We study the role of target representation: amino acid tokens encode residue identities without explicit contextual semantics, while backbone coordinates require a discrete representation in our framework. We introduce...
Mahdi Pourmirzaei, Farzaneh Esmaili, Amir Ziashahabi et al.· 0 citations
DNA barcoding is widely used for species identification, yet many computational classifiers continue to operate directly on raw nucleotide sequences. For large and heterogeneous barcode repositories, this representation can introduce avoidable computational cost because long nucleotide strings often contain redundant c...
Meetesh Nevendra, Deepak Singh· IEEE transactions on computa...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.