Dan Gusfield | |
---|---|
Born | Daniel Mier Gusfield |
Alma mater | University of California, Berkeley (BS, PhD) University of California, Los Angeles (MS) |
Known for | Stable marriage problem |
Awards |
|
Scientific career | |
Fields | Computer science Computational biology [1] |
Institutions | University of California, Davis Yale University |
Thesis | Sensitivity analysis for combinatorial optimization (1980) |
Doctoral advisor | Richard Karp [2] [3] |
Website | web |
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology. [1]
Gusfield received his undergraduate degree in computer science at the University of California, Berkeley, in 1973,[ citation needed ] his Master of Science degree in computer science from the University of California, Los Angeles (UCLA), in 1975,[ citation needed ] and his Ph.D. in engineering science from Berkeley in 1980; [3] his doctoral advisor was Richard Karp. [2]
Gusfield joined the faculty at Yale University in Computer Science in 1980, and left in 1986 to join the Department of Computer Science at UC Davis as an associate professor. Gusfield was made Professor of Computer Science in 1992 and served as the chair of the Department of Computer Science at UC Davis from 2000 to 2004. Gusfield was named distinguished professor in 2016, which is the highest campus-wide rank at the University of California at Davis. [4]
Gusfield's early work was in combinatorial optimization and its real-world application. One of his early major results was in network flow, where he presented a simple technique to convert any network flow algorithm to one that builds a Gomory-Hu tree, using only five added lines of pseudo-code. [5] Another contribution was in stable matching, where he contributed to a polynomial-time algorithm [6] for the Egalitarian Stable Marriage Problem, proposed by Donald Knuth. Gusfield's work on stable marriage resulted in the book, co-authored with Robert Irving, The Stable Marriage Problem: Structure and Algorithms. [7]
Starting in 1984, Gusfield branched out into computational biology, making Gusfield one of the first computer scientists to work in this field. His first result in computational biology was written in the Yale Technical Report The Steiner-Tree Problem in Phylogeny, which has never been published in a journal. His first published paper in computational biology, "Efficient Algorithms for Inferring Evolutionary History", was initially published as a technical report in 1988, [8] and was subsequently published in the journal Networks; [9] this paper is now the most cited of Gusfield's papers. Gusfield's 1993 paper on multiple sequence alignment [10] is the first publication indexed in PubMed under "computational biology".
Gusfield's impact on the early days of Computer Science research in algorithmic computational biology is substantial. He was a member of the United States Department of Energy Human Genome Research Program Panel in 1991, and a member of the steering committee for the Rutgers-Princeton DIMACS center special year on Mathematical Support for Molecular Biology from 1994 to 1995. In 1995, he co-organized the Dagstuhl Conference on Molecular Bioinformatics. He has been a member of the editorial board of the Journal of Computational Biology since its inception in 1996. At the University of California at Davis, he was part of a three-person group that proposed the development of the UC Davis Genomics Center, and served as a member of the Genomics Center Steering Committee (1999–2003), and helped to build an interdisciplinary community of biologists and computer scientists working together on genomics problems. Finally, in 2004, Gusfield helped propose the IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), one of the few journals specifically oriented towards computer science and mathematical researchers working in computational biology. He served as its founding editor in chief until 2009, [11] and later as chair of the TCBB Steering Committee. He was more recently an invited visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley during two of its semester-long programs (first on Evolution, and later on Algorithmic Challenges in Genomics). In addition, Gusfield has been the PhD advisor or postdoctoral mentor for many well known computer scientists working in computational biology, including Prof. Oliver Eulenstein (Iowa State University),[ citation needed ] Dr. Paul Horton (Tokyo),[ citation needed ] Prof. Ming-Yang Kao (Northwestern University),[ citation needed ] Prof. John Kececioglu (Arizona),[ citation needed ] Prof. Yun S. Song (UC Berkeley and Univ. of Pennsylvania),[ citation needed ] Prof. R. Ravi (CMU), Prof. Jens Stoye (Bielefeld), Prof. Lusheng Wang (City University of Hong Kong)[ citation needed ], and Prof. Yufeng Wu (U. Connecticut).[ citation needed ]
Gusfield has made significant contributions to molecular sequence comparison and analysis, [12] phylogenetic tree and phylogenetic network inference, [13] haplotyping in DNA sequences, [14] [15] [16] the multi-state perfect phylogeny problem using chordal graph theory, [17] and fast algorithms for RNA folding. [18] Since 2014 he has focused on the application and development of integer linear programming in computational biology.
Gusfield is most well known for his book Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, [19] which provides a comprehensive presentation of the algorithmic foundations of molecular sequence analysis for computer scientists, and has been cited more than 8000 times. [1] This book has helped to define and develop the intersection of computer science and computational biology. His second book in computational biology is on phylogenetic networks, [20] which are graph-theoretic models of evolution that go beyond the classical tree model, to address biological processes such as hybridization, recombination, and horizontal gene transfer.
His third book on computational biology was published in 2019. Integer Linear Programming in Computational and Systems Biology: An Entry-Level Text and Course (Cambridge University Press, 2019. ISBN 9781108421768) explains why and how Integer Linear Programming is a valuable technique for addressing and solving computational problems in biology. It is accompanied by over fifty computer programs that generate the needed inequalities for most of the topics discussed in the book. Subsequently, Gusfield and students explored the use of Satisfiability-solvers to efficiently solve biological problems where integer programming was not effective.
His fifth book[ clarification needed ] will be published by Cambridge Press in January 2024. It is entitled Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gôdel, Turing and more. It presents full, rigorous proofs of deep theorems establishing impossibility in a range of topic areas (in physics, economics, data science, computer science, mathematics, logic) using only arithmetic and simple logic. The presented proofs are built on the simplest, clearest proofs found in the literature, of theorems which originally were considered very difficult and for specialists only. The premise of the book is that more modern proofs of these theorems are much simpler and easier, and when presented for non-specialists, can be understood by anyone with no more than a junior-high education and with the discipline to follow a rigorous logical argument (pen in hand).[ citation needed ]
Gusfield was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2015 [21] for contributions to combinatorial optimization and computational biology . In 2016, Gusfield was elected a Fellow of the International Society for Computational Biology (ISCB) [22] for "his notable contributions to computational biology, particularly his algorithmic work on building evolutionary trees, molecular sequence analysis, optimization problems in population genetics, RNA folding, and integer programming in biology." In 2016, Gusfield was named a distinguished professor at the University of California at Davis, which is the highest campus-wide rank. He was elected an ACM Fellow in 2017. [23]
In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences. Aligned sequences of nucleotide or amino acid residues are typically represented as rows within a matrix. Gaps are inserted between the residues so that identical or similar characters are aligned in successive columns. Sequence alignments are also used for non-biological sequences such as calculating the distance cost between strings in a natural language, or to display financial data.
Computational biology refers to the use of data analysis, mathematical modeling and computational simulations to understand biological systems and relationships. An intersection of computer science, biology, and big data, the field also has foundations in applied mathematics, chemistry, and genetics. It differs from biological computing, a subfield of computer science and engineering which uses bioengineering to build computers.
Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
In computational phylogenetics, tree alignment is a computational problem concerned with producing multiple sequence alignments, or alignments of three or more sequences of DNA, RNA, or protein. Sequences are arranged into a phylogenetic tree, modeling the evolutionary relationships between species or taxa. The edit distances between sequences are calculated for each of the tree's internal vertices, such that the sum of all edit distances within the tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and computational effort.
Michael Spencer Waterman is a Professor of Biology, Mathematics and Computer Science at the University of Southern California (USC), where he holds an Endowed Associates Chair in Biological Sciences, Mathematics and Computer Science. He previously held positions at Los Alamos National Laboratory and Idaho State University.
Eugene Wimberly "Gene" Myers, Jr. is an American computer scientist and bioinformatician, who is best known for contributing to the early development of the NCBI's BLAST tool for sequence analysis.
Eugene Leighton (Gene) Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley.
Pavel Arkadevich Pevzner is the Ronald R. Taylor Professor of Computer Science and director of the NIH Center for Computational Mass Spectrometry at University of California, San Diego. He serves on the editorial board of PLoS Computational Biology and he is a member of the Genome Institute of Singapore scientific advisory board.
Bernard M. E. Moret is a Swiss-American computer scientist, an emeritus professor of Computer Science at the École Polytechnique Fédérale de Lausanne in Switzerland. He is known for his work in computational phylogenetics, and in particular for mathematics and methods for computing phylogenetic trees using genome rearrangement events.
Tandy Warnow is an American computer scientist and Grainger Distinguished Chair in Engineering at the University of Illinois at Urbana–Champaign. She is known for her work on the reconstruction of evolutionary trees, both in biology and in historical linguistics, and also for multiple sequence alignment methods.
David Sankoff is a Canadian mathematician, bioinformatician, computer scientist and linguist. He holds the Canada Research Chair in Mathematical Genomics in the Mathematics and Statistics Department at the University of Ottawa, and is cross-appointed to the Biology Department and the School of Information Technology and Engineering. He was founding editor of the scientific journal Language Variation and Change (Cambridge) and serves on the editorial boards of a number of bioinformatics, computational biology and linguistics journals. Sankoff is best known for his pioneering contributions in computational linguistics and computational genomics. He is considered to be one of the founders of bioinformatics. In particular, he had a key role in introducing dynamic programming for sequence alignment and other problems in computational biology. In Pavel Pevzner's words, "Michael Waterman and David Sankoff are responsible for transforming bioinformatics from a ‘stamp collection' of ill-defined problems into a rigorous discipline with important biological applications."
Ron Shamir is an Israeli professor of computer science known for his work in graph theory and in computational biology. He holds the Raymond and Beverly Sackler Chair in Bioinformatics, and is the founder and former head of the Edmond J. Safra Center for Bioinformatics at Tel Aviv University.
Ziv Bar-Joseph is an Israeli computational biologist and Professor in the Computational Biology Department and the Machine Learning Department at the Carnegie Mellon School of Computer Science.
Mathieu Daniel Blanchette is a computational biologist and Director of the School of Computer Science at McGill University. His research focuses on developing new algorithms for the detection of functional regions in DNA sequences.
Gad Menahem Landau is an Israeli computer scientist noted for his contributions to combinatorial pattern matching and string algorithms and is the founding department chair of the Computer Science Department at the University of Haifa.
Mona Singh is an American computer scientist and an expert in computational molecular biology and bioinformatics. She is the Wang Family Professor in Computer Science in the Lewis-Sigler Institute for Integrative Genomics and the Department of Computer Science at Princeton University. Since 2021, she has been the Editor-in-Chief of the Journal of Computational Biology.
Hanah Margalit is a Professor in the faculty of medicine at the Hebrew University of Jerusalem. Her research combines bioinformatics, computational biology and systems biology, specifically in the fields of gene regulation in bacteria and eukaryotes.
Vineet Bafna is an Indian bioinformatician and professor of computer science and director of bioinformatics program at University of California, San Diego. He was elected a Fellow of the International Society for Computational Biology (ISCB) in 2019 for outstanding contributions to the fields of computational biology and bioinformatics. He has also been a member of the Research in Computational Molecular Biology (RECOMB) conference steering committee.
Louxin Zhang is a Canadian computational biologist. He is currently a professor in the Department of Mathematics at the National University of Singapore. He is recognized for his contributions to combinatorial semigroup theory in mathematics. In addition, he is recognized for his work on the mathematical understanding of phylogenetic trees and networks, as well as the analysis of spaced seeds for sequence comparison in bioinformatics.
Tao Jiang is a Chinese-Canadian computer scientist and bioinformatician. He is Distinguished Professor of Computer Science and Engineering at the University of California, Riverside and was previously Distinguished Visiting Professor at Tsinghua University and Professor of Computer Science at McMaster University.