The Triggering Receptor Expressed on Myeloid cells 2 (TREM2) is an immune receptor with three complementarity-determining regions (CDR1-3) that primarily interact with the receptor's ligands. Aside from its role i...
详细信息
Background: Select patients are diagnosed with both psoriasis (PSO) and hidradenitis suppurativa (HS), leading to a unique disease pattern. Genetic risk factors remain unidentified. Methods: The study harnessed an int...
详细信息
We present in this paper an ab initio method, named KnotFold, for RNA H-type pseudoknot prediction. Our method employs an ensemble of RNA folding tools and a filtering heuristic to generate a set of pseudoknot-free st...
详细信息
We present in this paper an ab initio method, named KnotFold, for RNA H-type pseudoknot prediction. Our method employs an ensemble of RNA folding tools and a filtering heuristic to generate a set of pseudoknot-free stems, and then predicts pseudoknots by utilizing a search technique with a pseudo-probability scoring scheme. Experimental results show that KnotFold achieves higher sensitivity than existing methods. The KnotFold package with documentation is freely available at http://***/KnotFold.
Job portal is considerably useful for both job seekers and employers. It enables job seekers to look for an employment, to advance their careers, or to market themselves. As for the employers, they can post vacant pos...
详细信息
Motivation Biological pathways are extensively used for the analysis of transcriptome data to characterize biological mechanisms underlying various phenotypes. There are a number of computational tools that summarize...
详细信息
Motivation Biological pathways are extensively used for the analysis of transcriptome data to characterize biological mechanisms underlying various phenotypes. There are a number of computational tools that summarize transcriptome data at the pathway level. However, there is no comparative study on how well these tools produce useful information at the cohort level, enabling comparison of many samples or *** In this study, we systematically compared and evaluated 13 different pathway activity inference tools based on 5 comparison criteria using pan-cancer data set. This study has two major contributions. First, our study provides a comprehensive survey on computational techniques used by existing pathway activity inference tools. The tools use different strategies and assume different requirements on data: input transformation, use of labels, necessity of cohort-level input data, use of gene relations and scoring metric. Second, we performed extensive evaluations on the performance of these tools. Because different tools use different methods to map samples to the pathway dimension, the tools are evaluated at the pathway level using five comparison criteria. Starting from measuring how well a tool maintains the characteristics of original gene expression values, robustness was also investigated by adding noise into gene expression data. Classification tasks on three clinical variables (tumor versus normal, survival and cancer subtypes) were performed to evaluate the utility of tools for their clinical applications. In addition, the inferred activity values were compared between the tools to see how similar they are along with the scoring schemes they use.
Interactions between biological entities, whether cells, proteins or genes are under meticulous study. As high throughput calculations have made biological network a popular target for study, methods for comparison ha...
详细信息
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to automatic grid segmentation of the raw flu...
详细信息
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to automatic grid segmentation of the raw fluorescence microarray images by Markov Random Field (MRF) techniques. The main objectives are applicability to various types of array designs and robustness to the typical problems encountered in microarray images, which are contaminations and weak signal. We briefly introduce microarray technology and give some background on MRFs. Our MRF model of microarray gridding is designed to integrate different application specific constraints and heuristic criteria into a robust and flexible segmentation algorithm. We show how to compute the model components efficiently and state our deterministic MRF energy minimization algorithm that was derived from the 'Highest Confidence First' algorithm by Chou et al. Since MRF segmentation may fail due to the properties of the data and the minimization algorithm, we use supplied or estimated print layouts to validate results. Finally we present results of tests on several series of microarray images from different sources, some of them test sets published with other microarray gridding software. Our MRF grid segmentation requires weaker assumptions about the array printing process than previously published methods and produces excellent results on many real datasets. An implementation of the described methods is available upon request from the authors.
Large sequence data sets generated by high-throughput biology experiments have motivated development of more efficient sequence comparison algorithms. Bit-parallel alignment offers one approach to dealing with these l...
详细信息
ISBN:
(纸本)9781943436033
Large sequence data sets generated by high-throughput biology experiments have motivated development of more efficient sequence comparison algorithms. Bit-parallel alignment offers one approach to dealing with these large data sets. Bit-parallel alignment algorithms use bits in computer words to represent alignment scores within a single row of the alignment scoring matrix and use logic operations and addition to compute the scores in the next row. Recently, we developed BitPAl, a very fast, general method for bit-parallel global alignment when there is a single match and mismatch value. In this paper we address global alignment using substitution scoring, such as BLOSUM substitution scoring commonly used for protein sequences or transition-transversion scoring used for DNA sequences. Substitution scoring assigns a potentially different substitution weight to every pair of alphabet characters. We present a new approach based on partial sums of adjacent score differences. It runs in time O(mn log W/W ) where W is the number of values that are stored in a computer word (in our implementation, w/8 where w is the length of a computer word). Except for a pre-processing step, the running time does not depend on the substitution weights. In experiments reported here, our algorithm is over eight times faster than standard iterative dynamic programming and 30% faster than an accelerated SIMD version of dynamic programming. Copyright ISCA.
Publicly-available next-generation sequencing data has greatly expanded in the past decade, particularly through the work of several international consortia. These collaborative efforts have applied numerous assays pr...
暂无评论