M. Elloumi – Algorithms in Computational Molecular Biology (2011)

Автор: M. Elloumi
Название книги: Algorithms in Computational Molecular Biology
Формат: PDF
Жанр: Биоинформатика
Страницы: 1085
Качество: Изначально компьютерное, E-book

This book represents the most comprehensive and up-to-date collection of information on the topic of computational molecular biology. Bringing the most recent research into the forefront of discussion, Algorithms in Computational Molecular Biology studies the most important and useful algorithms currently being used in the field, and provides related problems. It also succeeds where other titles have failed, in offering a wide range of information from the introductory fundamentals right up to the latest, most advanced levels of study.

Computational molecular biology has emerged from the Human Genome Project as
an important discipline for academic research and industrial application. The exponential
growth of the size of biological databases, the complexity of biological problems,
and the necessity to deal with errors in biological sequences require the development
of fast, low-memory requirement and high-performance algorithms. This
book is a forum of such algorithms, based on new/improved approaches and/or techniques.
Most of the current books on algorithms in computational molecular biology
either lack technical depth or focus on specific narrow topics. This book is the first
overview on algorithms in computational molecular biology with both a wide coverage
of this field and enough depth to be of practical use to working professionals.
It surveys the most recent developments, offering enough fundamental and technical
information on these algorithms and the related problems without overloading the
reader. So, this book endeavors to strike a balance between theoretical and practical
coverage of a wide range of issues in computational molecular biology. Of course,
the list of topics that is explored in this book is not exhaustive, but it is hoped that
the topics covered will get the reader to think of the implications of the presented
algorithms on the developments in his/her own field. The material included in this
book was carefully chosen for quality and relevance. This book also presents a mixture
of experiments and simulations that provide not only qualitative but also quantitative
insights into the rich field of computational molecular biology. It is hoped
that this book will increase the interest of the algorithmics community in studying
a wider range of combinatorial problems that originate in computational molecular
biology. This should enable researchers to deal with more complex issues and richer
data sets.
Ideally, the reader of this book should be someone who is familiar with computational
molecular biology and would like to learn more about algorithms that deal with
the most studied, the most important, and/or the newest topics in the field of computational
molecular biology. However, this book could be used by a wider audience
such as graduate students, senior undergraduate students, researchers, instructors,
and practitioners in computer science, life science, and mathematics. We have tried
to make the material of this book self-contained so that the reader would not have
to consult a lot of external references. Thus, the reader of this book will certainly
find what he/she is looking for or at least a clue that will help to make an advance in his/her research. This book is quite timely, because the field of computational molecular
biology as a whole is undergoing many changes, and will be of a great use to
the reader.
This book is organized into seven parts: Strings Processing and Application to
Biological Sequences, Analysis of Biological Sequences, Motif Finding and Structure
Prediction, Phylogeny Reconstruction, Microarray Data Analysis, Analysis of
Genomes, and Analysis of Biological Networks. The 42 chapters, that make up the
seven parts of this book, were carefully selected to provide a wide scope with minimal
overlap between the chapters in order to reduce duplication. Each contributor
was asked that his/her chapter should cover review material as well as current developments.
In addition, we selected authors who are leaders in their respective fields