Title
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology,New
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
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 bioinformatics.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What topics are covered in 'Algorithms on Strings, Trees, and Sequences'? A: This book covers computer algorithms related to string processing, with a focus on applications in computer science and computational biology, including genetics and biological problems.
- Q: Who is the author of this book? A: The author of 'Algorithms on Strings, Trees, and Sequences' is Dan Gusfield, a recognized expert in the field of algorithms.
- Q: Is this book suitable for beginners? A: While the book is designed for graduate and advanced undergraduate students, it may be challenging for beginners without a foundational understanding of computer science concepts.
- Q: How many pages does the book contain? A: The book contains a total of 556 pages.
- Q: What is the binding type of the book? A: This book is available in hardcover binding, which is durable and suitable for extensive use.
- Q: When was this edition published? A: The first edition of 'Algorithms on Strings, Trees, and Sequences' was published on May 28, 1997.
- Q: What condition is this used book in? A: The used book is described as being in good condition, indicating it has been well-maintained.
- Q: Does the book include exercises for practice? A: Yes, the book includes over 400 exercises designed to reinforce the material and encourage further exploration of relevant topics.
- Q: Is this book suitable for bioinformatics students? A: Yes, the book is suitable for students in bioinformatics, as it combines concepts from computer science with applications in biology.
- Q: What makes this book different from other algorithm books? A: This book emphasizes fundamental ideas and techniques, providing new approaches to complex material that simplify understanding for non-specialists.