Transactions on Computational Systems Biology II / edited by Corrado Priami, Alexander Zelikovsky.

Springer eBooks

What Makes the Arc-Preserving Subsequence Problem Hard? -- Profiling and Searching for RNA Pseudoknot Structures in Genomes -- A Class of New Kernels Based on High-Scored Pairs of k-Peptides for SVMs and Its Application for Prediction of Protein Subcellular Localization -- A Protein Structural Alphabet and Its Substitution Matrix CLESUM -- KXtractor: An Effective Biomedical Information Extraction Technique Based on Mixture Hidden Markov Models -- Phylogenetic Networks: Properties and Relationship to Trees and Clusters -- Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees -- Calculating Genomic Distances in Parallel Using OpenMP -- Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays -- Virtual Gene: Using Correlations Between Genes to Select Informative Genes on Microarray Datasets.

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.