Строки, деревья и последовательности в алгоритмах: информатика и вычислительная биология

by Dan Gusfield, И.В. Романовский (Translator)

Книга Д. Гасфилда написана на основе лекций, которые автор читает в Университете Дэвиса, Калифорния.

В ней, по-видимому, впервые подробно излагается круг математических вопросов, связанных с применениями математики и информатики в задачах вычислительной молекулярной биологии. В этом направлении за последнее десятилетие накопилось целое море фактов, в том числе замечательных новых постановок задач, теоретических исследований и данных. Предлагаемая книга — их первое систематическое изложение.

Книга полезна научным работникам, студентам многих специальностей (не только по молекулярной биологии и по информатике) и даже старшеклассникам, которые захотят самостоятельно познакомиться с современными алгоритмами обработки практической информации. Она станет хорошим подарком талантливому подростку

Genres: Computer Science, Algorithms, Programming, Biology, Science, Mathematics, Reference

654 pages, Paperback

First published May 1, 1997

Reviews

[Jasper Peijer · Rating 4 out of 5]

Let's start with the positive notes; This book is an absolute masterpiece. It's rigorous, it's extensive, covers an insane range of string algorithms and brings them to life by discussing biological applications. Even now (almost 30 years later), the book is still relevant even though some newer algorithms and techniques are missing (like FM-index and Burrows-Wheeler transform). It's wide range of challenging exercises covers a great way to extend upon the algorithms by applying them to special use cases.

Now the downsides. First of all the book is incredibly challenging. For someone with little experience in formal mathematics and algorithmic analysis, it is incredibly tough to read and understand. The book utilizes a lot of symbolic language (sometimes using up to 15 symbols for a single algorithm), which can make it incredibly tough to read. In the places where this is occurring the most, the figures as equally absent, which is another problem with this book. In some places a couple of figures could have done a much better job, than several pages of text, making this a bad choice for visual learners. Furthermore the proofs can sometimes be incredibly dense, or even "left to the reader", which can be confusing for non-mathematical students. Finally, the exercises have no answer keys available, making it an incredibly tough book for self study.

Conclusion:

It's clearly a masterpiece, and the bible for string algorithms even though it has aged a little, both conceptually and pedagogically. I recommend anyone in the field of Computer Science, Computational Biology, or Bioinformatics to at least read this book once, even if just globally.

[Valia · Rating 4 out of 5]

Книга, немного покалеченная переводом и очень специализированная на комбинаторных методах, но в общем увлекательная.

[Stirling Westrup · Rating 5 out of 5]

If you're not doing work on matching huge gene sequences, then only the first third to half of the book will be relevant, but that portion should be required reading for all programmers, and if you are matching huge gene sequences, then this whole book is a goldmine.

[Michiel · Rating 3 out of 5]

Good, but somewhat outdated overview of algorithms for processing strings for computational biology.

[Alex · Rating 4 out of 5]

Great course book!