Combinatorial pattern matching algorithms in computational biology using Perl and R.

9781420069730

Combinatorial pattern matching algorithms in computational biology using Perl and R.

Valiente, Gabriel.

CRC / Taylor & Francis

2009

352 pages

$99.95

Hardcover

Mathematical and computational biology series

QH324

Combinatorial pattern matching algorithms are used to solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic, and interatomic data. This book for specialists in biology, mathematics, and computer science looks in depth at combinatorial pattern matching algorithms used in computational biology, and describes the implementation of combinatorial pattern matching algorithms in Perl and R, two widely used scripting languages. An introductory chapter gives background on the biological, mathematical, and computational notions used in the book. Subsequent chapters provide an intuitive presentation of the algorithms, followed by a detailed exposition in pseudo-code. Material is structured around the specific algorithmic problems when dealing with structures commonly found in computational biology: biological sequences (such as DNA, RNA, and protein sequences); trees (such as phylogenetic trees and RNA structures); and graphs (such as phylogenetic networks and signaling pathways). For each of these structures, a clear distinction is made between the problems that arise in the analysis of one structure and the comparative analysis of two or more structures. Appendices introducing Perl and R are included. Readers are assumed to have some background in mathematics ad computer programming. The editor is affiliated with the Technical University of Catalonia, Barcelona.

([c]2009 Book News, Inc., Portland, OR)