Papershelf
Papers I've read, am reading, and plan to read.
Mostly on indexing, retrieval and DNA sequence models, which is where my database work and my lab work meet. The "up next" list is the queue I'm working through.
Read · 7
- Hist-Tree: Those Who Ignore It Are Doomed to LearnCrotty · CIDR 2021 · Presented it in my MSc seminar.
- The Case for Learned Index StructuresKraska et al. · SIGMOD 2018 · The paper Hist-Tree argues against.
- The PGM-index: a fully-dynamic compressed learned index with provable worst-case boundsFerragina & Vinciguerra · PVLDB 2020 · One of the learned indexes Hist-Tree beats.
- RadixSpline: A Single-Pass Learned IndexKipf et al. · aiDM 2020 · Built in one pass; the third learned index in Hist-Tree's comparison.
- FlashPPI: Linear-time prediction of proteome-scale microbial protein interactionsbioRxiv 2026 · The starting point for my lab project.
- Neural Distance Embeddings for Biological Sequences (NeuroSEED)Corso et al. · NeurIPS 2021 · The four-part framework my retrieval design adapts.
- Lehninger Principles of Biochemistry, ch. 8.1–8.2 (nucleotides and nucleic acids)Textbook · Recommended by my PhD supervisor.
Reading now · 6
- Accurate prediction of oligonucleotide probe hybridization efficiency via a transformer-based modelPMC
- DNABERT-2: Efficient Foundation Model and Benchmark for Multi-Species GenomeZhou et al. · 2023
- HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide ResolutionNguyen et al. · 2023
- DNABERT: pre-trained Bidirectional Encoder Representations from Transformers model for DNA-language in genomeJi et al. · Bioinformatics 2021
- Nucleotide Transformer: building and evaluating robust foundation models for human genomicsDalla-Torre et al. · Nature Methods
- Benchmarking DNA foundation modelsNature Communications 2025
Up next · 7
- A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamicsSantaLucia · PNAS 1998 · The ΔG parameters behind primer3.
- Representation Learning with Contrastive Predictive Codingvan den Oord et al. · 2018 · Where the InfoNCE loss comes from.
- Dense Passage Retrieval for Open-Domain Question AnsweringKarpukhin et al. · EMNLP 2020 · The classic two-tower retriever.
- Billion-scale similarity search with GPUs (FAISS)Johnson, Douze & Jégou · 2017
- Efficient and robust approximate nearest neighbor search using HNSW graphsMalkov & Yashunin · 2016
- Product Quantization for Nearest Neighbor SearchJégou, Douze & Schmid · TPAMI 2011
- Fast Exact Search in Hamming Space with Multi-Index HashingNorouzi, Punjani & Fleet · TPAMI 2014 · An exact baseline for mismatch-range search.