Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R Chapman & Hall/CRC Computational Biology Series
Auteur : Valiente Gabriel
Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic, and interactomic data. It implements the algorithms in Perl and R, two widely used scripting languages in computational biology.
The book provides a well-rounded explanation of traditional issues as well as an up-to-date account of more recent developments, such as graph similarity and search. It is organized around the specific algorithmic problems that arise when dealing with structures that are commonly found in computational biology, including biological sequences, trees, and graphs. For each of these structures, the author makes a clear distinction between problems that arise in the analysis of one structure and in the comparative analysis of two or more structures. He also presents phylogenetic trees and networks as examples of trees and graphs in computational biology.
This book supplies a comprehensive view of the whole field of combinatorial pattern matching from a computational biology perspective. Along with thorough discussions of each biological problem, it includes detailed algorithmic solutions in pseudo-code, full Perl and R implementation, and pointers to other software, such as those on CPAN and CRAN.
Introduction. SEQUENCE PATTERN MATCHING: Sequences. Simple Pattern Matching in Sequences. General Pattern Matching in Sequences. TREE PATTERN MATCHING: Trees. Simple Pattern Matching in Trees. General Pattern Matching in Trees. GRAPH PATTERN MATCHING: Graphs. Simple Pattern Matching in Graphs. General Pattern Matching in Graphs. Appendices. References. Index.
Gabriel Valiente is Associate Professor in the Department of Software at the Technical University of Catalonia. His research interests include computational biology, bioinformatics, exact and approximate matching in graphs and patterns, and graph transformation.
Date de parution : 06-2017
15.6x23.4 cm
Date de parution : 04-2009
Ouvrage de 368 p.
15.6x23.4 cm
Thèmes de Combinatorial Pattern Matching Algorithms in... :
Mots-clés :
Phylogenetic Networks; Terminal Nodes; phylogenetic; Perl Script; network; Phylogenetic Trees; script; Unrooted Phylogenetic Tree; terminal; RNA Secondary Structure; node; Partition Distance; tree; Hybrid Node; unrooted; Suffix Arrays; internal; DNA Sequence; previous; Computational Biology; hybrid; Dynamic Programming Table; T1 T2; ATG TGA; Vertex Sequence; Protein Interaction Networks; Nodal Distance; DNA Sequence Fragment; Recent Common Ancestor; Sequence S1; Unrooted Trees; Previous Algorithm; Ctg; Suffix Trees; Elementary Paths