Warren Richard Gish is the owner of Advanced Biocomputing LLC. He joined Washington University School of Medicine as a junior faculty member in 1994, and was a Research Associate Professor of Genetics from 2002 to 2007.
Education After initially studying physics, Gish obtained an A.B. degree in Biochemistry from University of California, Berkeley, and completed work for his Ph.D. degree in Molecular Biology at the same institution in 1988.
Research Gish is primarily known for his contributions to NCBI BLAST, including creation and support of the BLAST Network Service, development and support of the nr (quasi-nonredundant) databases in February 1991, introduction of gapped BLAST (WU-BLAST 2.0) in May 1996, and his continued work on AB-BLAST. At Washington University in St. Louis, Gish led the genome analysis group which annotated all finished human, mouse and rat genome data produced by the university's Genome Sequencing Center from 1995 through 2002. First available to internal users in December 1989, the NCBI BLAST Network Service was opened to the public in March 1990, shortly after the BLAST manuscript was accepted for publication. This was several months before the paper would appear in print, so the NCBI director requested that availability of the network service not be published. Since the service ran the latest BLAST software on fast SMP hardware against comprehensive, daily-updated sequence databases, word-of-mouth publicity soon established the NCBI as a convenient, one-stop shop for sequence similarity searching. Like the BLAST Network Service, Gish's subsequent independently undertaken projects would rely on word-of-mouth publicity. In 1985, to address a frequent need for rapid identification of restriction enzyme recognition sites in DNA, Gish developed a deterministic finite automaton function library in the C language. The idea of applying a finite-state machine to this problem was suggested by fellow graduate student and Berkeley Software Distribution developer Michael J. Karels, who noted that the finite-state automaton techniques used by grep might be applicable. Gish's DFA implementation used a Mealy machine architecture, which is more compact than an equivalent Moore machine and therefore more efficient. The resulting automata could scan subject sequences for recognition sites in a single pass without backtracking. Although developed independently, the DFA construction method was later observed to effectively consolidate Algorithms 3 and 4 described by Alfred Aho and Margaret J. Corasick. While working at the University of California, Berkeley, in December 1986, Gish sped up the FASTP program
… excerpt ends here. Continue reading the full article.
