Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (Hardback)
$93.96 - Save $5.04 (5%) - RRP $99.00 Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 72 hours | |Short Description for Algorithms on Strings, Trees and Sequences This 1997 book describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.
Full description- Publisher: CAMBRIDGE UNIVERSITY PRESS
- Published: 01 June 1997
- Format: Hardback 556 pages
- See: Full bibliographic data
- Categories: Discrete Mathematics | Computing: General | Computer Programming / Software Development | Algorithms & Data Structures | Pattern Recognition
- ISBN 13: 9780521585194 ISBN 10: 0521585198
- Sales rank: 383,330
Other books
Full description for Algorithms on Strings, Trees and Sequences
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 (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises 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. Its discussion of current algorithms and techniques also makes it a reference for professionals.
