Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology FROM THE PUBLISHER
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data produced by various genome projects. This book explains a wide range of computer methods for string processing. It also contains extensive discussions on biological problems that are cast as string problems, and on techniques to solve them. The book is both a reference for computer scientists and computer-oriented professionals in biology and bio-informatics and a textbook for graduate and advanced undergraduate courses on string algorithms and on computational biology.
SYNOPSIS
Provides a rigorous treatment of algorithms that operate on character strings and sequences. Covers a wide spectrum of string algorithms from classical computer science to modern molecular biology, when possible, integrating those two fields.
AUTHOR DESCRIPTION
Daniel M. Gusfield,
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 and bioinformatics.
Home
