Brian T. Naughton

发表

MotifCut: regulatory motifs finding with maximum density subgraphs

Serafim Batzoglou, Douglas L. Brutlag, Eugene Fratkin, 2006, ISMB.

Efficient Replication of over 180 Genetic Associations with Self-Reported Medical Data

Nicholas Eriksson, Chuong B. Do, Brian T. Naughton, 2011, PloS one.

Analysis of 589,306 genomes identifies individuals resilient to severe Mendelian childhood diseases

Brian T. Naughton, Jason R. Bobe, H. Hakonarson, 2016, Nature Biotechnology.

HEx: A heterologous expression platform for the discovery of fungal natural products

Diane O. Inglis, Brian T. Naughton, James R. Hennessy, 2018, Science Advances.

White Paper 2303 Guidelines on Vetting Genetic Associations

Brian T. Naughton, Andro R. Hsu, Shirley Wu, 2010 .

Web-Based, Participant-Driven Studies Yield Novel Genetic Associations for Common Traits

Brian T. Naughton, Lawrence S. Hon, N. Eriksson, 2010, PLoS genetics.

Parametric Linkage Analysis and Disequilibrium Methods to Identify Loci for Complex Disease

Brian T. Naughton, Daniel L. Koller, B. Naughton, 2001, Genetic epidemiology.

Turning the world's DNA into new medicines.

Brian T. Naughton, Colin J. B. Harvey, Kyle L. Dunbar, 2022, Trends in Biotechnology.

A graph-based motif detection algorithm models complex nucleotide dependencies in transcription factor binding sites

Brian T. Naughton, S. Batzoglou, E. Fratkin, 2006, Nucleic acids research.

Finding Regulatory Motifs with Maximum Density Subgraphs

Serafim Batzoglou, Douglas L. Brutlag, Eugene Fratkin, 2006 .

Inducible mismatch repair streamlines forward genetic approaches to target identification of cytotoxic small molecules.

Brian T. Naughton, Vishal Khivansara, B. Posner, 2023, Cell chemical biology.

Symposium Co-chairs Administrative Help Symposium Volunteers Symposium Information Biomedical Information Technology Stanford about Bits Symposium Schedule and Map

Brian T. Naughton, B. Naughton, Samuel Ieong, 2003 .