Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and RCRC Press, 8 avr. 2009 - 368 pages 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 |
Table des matières
| 1 | |
Chapter 2 Sequences | 21 |
Chapter 3 Simple Pattern Matching in Sequences | 43 |
Chapter 4 General Pattern Matching in Sequences | 53 |
Chapter 5 Trees | 115 |
Chapter 6 Simple Pattern Matching in Trees | 137 |
Chapter 7 General Pattern Matching in Trees | 155 |
Chapter 8 Graphs | 181 |
Chapter 9 Simple Pattern Matching in Graphs | 211 |
Chapter 10 General Pattern Matching in Graphs | 247 |
Appendix A Elements of Perl | 275 |
Appendix B Elements of R | 305 |
References | 339 |
| 351 | |
Back Cover
| 353 |
Autres éditions - Tout afficher
Combinatorial Pattern Matching Algorithms in Computational Biology Using ... Gabriel Valiente Aucun aperçu disponible - 2009 |
Combinatorial Pattern Matching Algorithms in Computational Biology Using ... Gabriel Valiente Aucun aperçu disponible - 2017 |
Expressions et termes fréquents
amino acids BioPerl block of code char combinatorial pattern matching common semi-strict ancestors computational biology deletions directed acyclic graph DNA sequence dynamic programming dynamic programming table edge edit distance elements elsif codon eq eNewick string Example EXPR FALSE FALSE FALSE following Perl script following R script fully resolved rooted function hash hybrid node implemented in Perl include any method input internal node k-mer labeled sequence LCSA Levenshtein distance loop matrix maximum agreement subtree method to compute Newick nodal distance nucleotides obtained occurrences open reading frame output path multiplicity vectors pattern matching Phylo phylogenetic networks position previous algorithm quartets recent common semi-strict representation of phylogenetic resolved rooted phylogenetic rooted phylogenetic trees S1 and S2 scalar sequences of length sequences S1 shift shown stop codon subgraph subroutine substr subtrees induced suffix array taxa terminal nodes labeled time-consistent traversal tree-child phylogenetic networks triplets distance triplets of terminal variable