Название: A Computer Scientist's Guide to Cell Biology 2nd Edition
Автор: William Cohen, Charles Cohen
Издательство: Springer
Год: 2024
Страниц: 121
Язык: английский
Формат: pdf (true), epub
Размер: 31.2 MB

Unlike the structured world of Computer Science, biology is complex, evolving, and often lacks clean abstract models. This book aims to serve as a guide for computer scientists who need to understand cell biology, breaking the field into three parts: biological mechanics, experimental methods, and language/nomenclature. While biological mechanics, which investigates cellular-level details, is covered by many texts, this book also focuses on experimental methods – how biologists conduct experiments and gather data - and on helping the reader understand the language and terminology of biology, which is rich but challenging for non-biologists.

A Computer Scientist's Guide to Cell Biology uses a metaphor of biology as a strange land with an unfamiliar language and customs. The goal of the book is to provide a high-level introduction to cell biology, simplifying concepts and relating them to familiar ideas from Computer Science, so that working computer scientists can more effectively understand read recent research papers and results.

This Second Edition contains a number of updates, including discussions of CRISPR, advances in DNA Sequencing, and mRNA vaccines. It serves as an easy-to-read travel guide for computer scientists navigating the intricate and sometimes perplexing terrain of cell biology, offering insights into experimental methods and helping bridge the gap between the structured world of Computer Science and the complexities of biological systems.

This book is for the many curious souls who are coming into biology from backgrounds in Computer Science, especially the fields of information retrieval, natural language processing (NLP), and/or Machine Learning. One major difference between biology and Computer Science is that in Computer Science, the world we explore is in large part our own creation, and a large part of what we do is make our creation understandable by finding useful abstractions, and then building more complex things by combining these abstractions together. For example, a deterministic finite state machine is a useful abstraction for computations that process discrete inputs sequentially with limited memory—we study this, and study stack data structures, and then study the result of combining them to make a push-down automaton. These abstractions might be compromised when we optimize our systems for performance, but they are rarely abandoned completely, because comprehensibility, elegance, and simplicity are practically important for systems that must be maintained and improved by humans.




ОТСУТСТВУЕТ ССЫЛКА/ НЕ РАБОЧАЯ ССЫЛКА ЕСТЬ РЕШЕНИЕ, ПИШИМ СЮДА!