Algorithms on Strings, Trees, and Sequences Computer Science and Computational Biology

E-029: Cambridge University Press. Very Good. 1997. Hardcover. Hardcover. 8vo. Cambridge University Press, Cambridge, UK. 1999. 556 pgs. Illustrated throughout. Reprint. Bound in illustrated paper covered boards with titles present to the spine and front board. Boards have light shelf-wear present to the extremities. No ownership marks present. Text is clean and free of marks. Binding tight and solid. Traditionally an area of study in computer science, string algorithms have, in recent years, become an increasingly important part of biology, particularly genetics. This volume is a comprehensive look at computer algorithms for string processing. In addition to pure computer science, Gusfield adds extensive discussions on biological problems that are cast as string problems and on methods developed to solve them. This text emphasizes the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. E-029; 10.1 X 7.2 X 1.3 inches; 556 pages .