Transactions on Computational Systems Biology IIAlexander Zelikovsky Springer Berlin Heidelberg, 04.11.2005 - 156 Seiten The LNCS journal Transactions on Computational Systems Biology is devoted to inter- and multidisciplinary research in the fields of computer science and life sciences and supports a paradigmatic shift in the techniques from computer and information science to cope with the new challenges arising from the systems oriented point of view of biological phenomena. This second volume of the Transactions on Computational Systems Biology is devoted to considerably extended versions of selected papers presented at the International Workshop on Bioinformatics Research and Applications (IWBRA 2005), part of the International Conference on Computational Science (ICCS 2005), which took place at Emory University, Atlanta, Georgia, USA, in May 2005. The ten papers selected for the special issue cover a wide range of bioinformatics research such as problems in RNA structure prediction, coding schemes and structural alphabets for protein structure prediction, novel techniques for efficient gene transfer in phylogenetic networks, practical algorithms minimizing recombinations in pedigree phasing, parallel implementation in Open MP for finding the corresponding shortest edit distance between two signed gene permutations, and bioinformatics problems in DNA microarrays. |
Inhalt
What Makes the ARCPRESERVING SUBSEQUENCE Problem Hard? | 1 |
Profiling and Searching for RNA Pseudoknot Structures in Genomes | 37 |
A Protein Structural Alphabet and Its Substitution Matrix CLESUM | 59 |
Urheberrecht | |
5 weitere Abschnitte werden nicht angezeigt.
Andere Ausgaben - Alle anzeigen
Transactions on Computational Systems Biology V Tony Hu,Yi Pan,Tsau Young Lin Keine Leseprobe verfügbar - 2006 |
Häufige Begriffe und Wortgruppen
a₁ and a2 active terminal alignment Alon dataset amino acid APS problem arrays base G Bioinformatics Biology BLOSUM c-tokens c₁ Ci+1 clade classification accuracy classifier cluster CM components complexity Computational construction contains defined deleted denote experiments extraction feasible haplotype configurations feature selection Figure gene selection genome genotype GGA GGA GGA Hidden Markov Models hybridization inheritance profile Intel C++ compiler k-MRHI k-peptide kernel KN,D KXtractor least one base Lemma matched matrix method MiHMM Min-Deg network node NP-C NP-complete nucleotides number of genes obtained OpenMP pairs pairwise t-score pairwise virtual gene pedigree performance phylogenetic network polynomial prediction accuracy primer Primer-Del+ protein pseudoknot pseudoknot structures rep(i resp root sample secondary structures selection algorithms sentence single POS HMM substitution matrix substrings support vector machines T-decomposition t-score terminal edge text chunking tree node tree search algorithm virtual gene algorithm