Jeremy D. Buhler, PhD

Computer Science and Engineering

Computational and Systems Biology Program
Molecular Genetics and Genomics Program

  • 314-935-6180

  • 314-935-7302

  • 1045

  • 1036 McKelvey Hall



  • annotation, bioinformatics, computational biology, genome analysis, metagenomics

  • Developing algorithms and architectures for large-scale biosequence comparison, genome annotation, and metagenomics

Research Abstract:

Detecting local similarities among biosequences is fundamental to the task of assigning identity, historical context, and putative function to parts of genomes. While efficient and sensitive similarity search algorithms such as BLAST have served the biological community well in the past, we must adapt these tools to meet emerging analytical needs in genomics. Exponential growth of both our sequence databases and our capacity to generate new sequence can obsolete methods that were "fast enough" in the past; moreover, new applications, such as discovering new protein families from metagenomic data or alignment of short reads with errors to a sequenced genome, pose bioinformatic challenges that require us to extend existing algorithms and to propose new ones.

My lab explores new algorithmic techniques for designing biosequence similarity search tools. We seek to anticipate the needs of the biological community for new tools, to establish firm theoretical foundations for the design of existing tools, and to discover techniques that make new classes of search problem feasible. For example, our work on the PROJECTION motif-finding algorithm and on Wang and Stormo`s PhyloNet motif search tool extended these tools to problem sizes and complexities that were previously beyond their scope. Our ongoing work on Mercury BLAST, an FPGA-accelerated engine for BLAST, seeks to exploit the low-level parallelism in today`s high-performance computing architectures to accelerate similarity search. We are also exploring challenges in clustering, assembling, and interpreting reads from metagenomic datasets, as well as fundamental questions of how to enable simpler, faster construction of new bioinformatics tools for high-performance computing architectures.

Selected Publications:

H. Sun and J. D. Buhler. "PhyLAT: a phylogenetic local alignment tool." Bioinformatics 28(10):1336-1344, 2012.

N. Ihuegbu, G. Stormo, and J. Buhler. "Fast, sensitive discovery of conserved genome-wide motifs." Journal of Computational Biology 19(2):139-147, 2012.

A. Jacob, J. Buhler, and R. Chamberlain. "Rapid RNA Folding: Analysis and Acceleration of the Zuker Recurrence." Proc. 18th IEEE Ann. Intl. Symposium on Field-Programmable Custom Computing Machines (FCCM) 87-94, Charlotte, NC, 2010.

Y. Sun, J. Buhler, and C. Yuan. "Designing filters for fast known nCRNA identification." IEEE/ACM Transactions on Computational Biology and Bioinformatics 9(3):774-787, 2012.
Sun Y and Buhler J. Designing patterns and profile for faster HMM search. IEEE Transactions on Computational Biology and Bioinformatics 2009 6(2):232-243.

Buhler J, Lancaster J, Jacob A, and Chamberlain R. Mercury BLASTN: fast streaming DNA sequence comparison. Proceedings of the 2007 Reconfigurable Systems Summer Institute (RSSI07).

Sonnenburg JL, Xu J, Leip DD, Chien C-H, Westover B-P, Weatherford J, Buhler JD, and Gordon JI. Glycan foraging in vivo by an intestine-adapted bacterial symbiont. Science 2005 307:1955-1959.

Buhler J, Keich U, and Sun Y. Designing seeds for similarity search in genomic DNA. Journal of Computing and Systems Science 2005 70:342-363.

Buhler J and Tompa M. Finding motifs using random projections. Journal of Computational Biology 2002 9:225-242.

Last Updated: 11/7/2022 12:22:09 PM

Back To Top

Follow us: