mlsanityData to 14 Oct 2026

dnaHNet: A Scalable and Hierarchical Foundation Model for Genomic Sequence Learning

arXiv 2602.10603 ↗First posted 11 Feb 2026cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Genomic foundation models have the potential to decode DNA syntax, yet face a fundamental tradeoff in their input representation. Standard fixed-vocabulary tokenizers fragment biologically meaningful motifs such as codons and regulatory elements, while nucleotide-level models preserve biological coherence but incur prohibitive computational costs for long contexts. We introduce dnaHNet, a state-of-the-art tokenizer-free autoregressive model that segments and models genomic sequences end-to-end. Using a differentiable dynamic chunking mechanism, dnaHNet compresses raw nucleotides into latent tokens adaptively, balancing compression with predictive accuracy. Pretrained on prokaryotic genomes, dnaHNet outperforms leading architectures including StripedHyena2 in scaling and efficiency. This recursive chunking yields quadratic FLOP reductions, enabling >3 × inference speedup over Transformers. On zero-shot tasks, dnaHNet achieves superior performance in predicting protein variant fitness and gene essentiality, while automatically discovering hierarchical biological structures without supervision. These results establish dnaHNet as a scalable, interpretable framework for next-generation genomic modeling.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 32 references that are in the map. First posted on arXiv 11 Feb 2026.

Builds on

14 of 32 references.

References · 14

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  3. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  4. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
  5. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  6. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  7. 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 192
  8. 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 146
  9. 2023DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genomecited by 143
  10. 2025Dynamic Chunking for End-to-End Hierarchical Sequence Modelingcited by 72
  11. 2025BioReason: Incentivizing Multimodal Biological Reasoning within a DNA-LLM Modelcited by 37
  12. 2024Model Decides How to Tokenize: Adaptive DNA Sequence Tokenization with MxDNAcited by 12
2 more
  1. 2025MergeDNA: Context-aware Genome Modeling with Dynamic Tokenization through Token Mergingcited by 2
  2. 2025Hybrid Tokenization Strategy for DNA Language Model using Byte Pair Encoding and K-MER Methodscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Near-Lossless Model Compression Enables Longer Context Inference in DNA Large Language Models
  2. 2026Wisteria: A Unified Multi-Scale Feature Learning Framework for DNA Language Model
  3. 2023PoET: A generative model of protein families as sequences-of-sequences
  4. 2025JanusDNA: A Powerful Bi-directional Hybrid DNA Foundation Model
  5. 2026Causal dictionary learning reveals and validates transcription-factor binding features in genomic language models
  6. 2024Self-Distillation Improves DNA Sequence Inference
  7. 2025HAD: Hybrid Architecture Distillation Outperforms Teacher in Genomic Sequence Modeling
  8. 2025Lost in Tokenization: Context as the Key to Unlocking Biomolecular Understanding in Scientific LLMs