GHGavin Hearne

Gavin Hearne

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Gavin Hearne has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Improving genomic language model reliability under distribution shift

    by Gavin Hearne, Mohammad Saleh Refahi, Robi Polikar, Gail L. Rosen

    Transformer-based Genomic Language Models (GLMs) have achieved strong performance across diverse genomic prediction tasks. However, their tendency toward overconfident predictions—particularly on noisy or unfamiliar data—limits reliability. In genomics, where unknown species and novel variants are common, developing models robust to distribution shift is crucial for dependable predictions. Here, we analyze the impact of several common and novel uncertainty quantification (UQ) methods in the context of GLMs, evaluating their performance across diverse downstream genomic and metagenomic prediction tasks. Comparing model behavior on both in-distribution (ID) and out-of-distribution (OOD) data, we show that temperature scaling and epistemic neural networks are capable of improving classification reliability across multiple GLM architectures and domains. The software is available at: https://github.com/EESI/glm-epinet-pyt

  • Open Access

    Normalized compression distance for DNA classification

    by Gavin Hearne, Mohammadsaleh S. Refahi, Haozhe (Neil) Duan, James R. Brown, Gail L. Rosen

    Analyzing the origin and diversity of numerous genomic sequences, such as those sampled from the human microbiome, is an important first step in genomic analysis. The use of normalized compression distance (NCD) has demonstrated capabilities in the field of text classification as a low-resource alternative to deep neural networks (DNNs) by leveraging compression algorithms to approximate Kolmogorov information distance. In an effort to apply this technique toward genomics tasks akin to tools such as Many-against-Many sequence searching (MMseqs) and Kraken2, we have explored the use of a gzip -based NCD combination in both gene labeling of open reading frames (ORFs) and taxonomic classification of short reads. Our implementation achieved 0.89 accuracy and 0.88 macro-F1 on human gene classification, surpassing similar NCD-based approaches. In prokaryotic gene labeling tasks, NCD shows superior classification accuracy to traditional alignment or exact-match tools in out-of-distribution settings, while also outperforming comparable sequence-embedding methods in in-distribution classification. However, the computational complexity of O(MN) (in standard big-O notation, where M and N denote the sizes of the training and test databases, respectively) constrains scalability to very large datasets, though these findings nonetheless demonstrate that compression-based approaches provide an effective alternative for genomic sequence classification, particularly in low-data environments.

  • Open Access

    Large Language Models for Molecular Biology (LLMBio): Editorial

    by Gavin Hearne, Glen Rogers, Chaz Allegra, Robi Polikar, Gail Rosen

  • Open Access

    Fast and Scalable Gene Embedding Search: A Comparative Study of FAISS and ScaNN

    by Mohammadsaleh Refahi, Gavin Hearne, Harrison Muller, Kieran Lynch, Bahrad A. Sokhansanj, James R. Brown, Gail Rosen


  • Open Access

    Normalized Compression Distance for DNA Classification

    by Gavin L.A. Hearne, Mohammad S. Refahi, Haozhe Neil Duan, James R. Brown, Gail L. Rosen

    The increasingly common use of next-generation sequencing has enabled greater access to large-scale (meta-)genomic datasets than ever before. The resulting deluge of data has made the quest for efficient DNA sequence classification methods an urgent challenge for downstream analyses. Traditional sequence alignment-based methods for DNA sequence classification struggle when presented with increasingly large volumes of sequence data due to the computational complexity of alignment. Subsequently, there is a need for methods capable of sequence identification without alignment. Normalized compression distance (NCD) has demonstrated capabilities in the field of text classification as a low-resource alternative to deep neural networks by leveraging compression algorithms to approximate Kolmogorov information distance. In an effort to apply this technique toward genomics tasks akin to tools such as Many-against-Many sequence searching (MMseqs) and Kraken2, we have explored the use of a gzip-based NCD towards both gene labeling of ORFs (open reading frames) and taxonomic classification of short reads. This demonstrates the efficacy of NCD in diverse multitask classification, and we further explore the capacity for NCD to classify larger libraries of metagenomic reads.