Daniel M. Gusfield
Professor
Ph.D., UC Berkeley, 1980
Professor Gusfield's primary interests involve the efficiency of algorithms, particularly for problems in combinatorial optimization and graph theory. These algorithms have been applied to study data and computer security, stable matching, network flow, matroid optimization, and string/pattern matching problems. Currently, Professor Gusfield is focused on string and combinatorial problems that arise in computational biology, particularly involving bioinformatics and genomics.
Professor Gusfield's personal web page
Office: 2125 Kemper HallPhone: (530) 752-7131
E-mail: gusfield@cs.ucdavis.edu