• 主题
高级搜索  >
历史搜索 清空历史

您现在的位置：首页>美国卫生研究院文献>Advances in Bioinformatics

期刊信息

  • 期刊名称：

    -

  • 刊频：
  • NLM标题：
  • iso缩写： -
  • ISSN： -

年度选择

更多>>

  • 排序：
  • 显示：
  • 每页：
全选（0）
<5/10>
共181条结果
  • 1.

    【2hr】Prediction of B-Cell Epitopes in Listeriolysin O, a Cholesterol Dependent Cytolysin Secreted by Listeria monocytogenes

    包量

    机译 李斯特菌溶血素O（一种由单核细胞增生性李斯特菌分泌的胆固醇依赖性细胞溶解素）中B细胞表位的预测
    摘要：Listeria monocytogenes is a gram-positive, foodborne bacterium responsible for disease in humans and animals. Listeriolysin O (LLO) is a required virulence factor for the pathogenic effects of L. monocytogenes. Bioinformatics revealed conserved putative epitopes of LLO that could be used to develop monoclonal antibodies against LLO. Continuous and discontinuous epitopes were located by using four different B-cell prediction algorithms. Three-dimensional molecular models were generated to more precisely characterize the predicted antigenicity of LLO. Domain 4 was predicted to contain five of eleven continuous epitopes. A large portion of domain 4 was also predicted to comprise discontinuous immunogenic epitopes. Domain 4 of LLO may serve as an immunogen for eliciting monoclonal antibodies that can be used to study the pathogenesis of L. monocytogenes as well as develop an inexpensive assay.
  • 2.

    【2hr】Pharmacophore Modeling and Molecular Docking Studies on Pinus roxburghii as a Target for Diabetes Mellitus

    包量

    机译 樟子松作为糖尿病靶点的药理学建模和分子对接研究
    摘要：The present study attempts to establish a relationship between ethnopharmacological claims and bioactive constituents present in Pinus roxburghii against all possible targets for diabetes through molecular docking and to develop a pharmacophore model for the active target. The process of molecular docking involves study of different bonding modes of one ligand with active cavities of target receptors protein tyrosine phosphatase 1-beta (PTP-1β), dipeptidyl peptidase-IV (DPP-IV), aldose reductase (AR), and insulin receptor (IR) with help of docking software Molegro virtual docker (MVD). From the results of docking score values on different receptors for antidiabetic activity, it is observed that constituents, namely, secoisoresinol, pinoresinol, and cedeodarin, showed the best docking results on almost all the receptors, while the most significant results were observed on AR. Then, LigandScout was applied to develop a pharmacophore model for active target. LigandScout revealed that 2 hydrogen bond donors pointing towards Tyr 48 and His 110 are a major requirement of the pharmacophore generated. In our molecular docking studies, the active constituent, secoisoresinol, has also shown hydrogen bonding with His 110 residue which is a part of the pharmacophore. The docking results have given better insights into the development of better aldose reductase inhibitor so as to treat diabetes related secondary complications.
  • 3.

    【2hr】Elementary Flux Mode Analysis of Acetyl-CoA Pathway in Carboxydothermus hydrogenoformans Z-2901

    包量

    机译 氢氧碳羧甲烷Z-2901中乙酰辅酶A途径的基本通量模式分析
    摘要：Carboxydothermus hydrogenoformans is a carboxydotrophic hydrogenogenic bacterium species that produces hydrogen molecule by utilizing carbon monoxide (CO) or pyruvate as a carbon source. To investigate the underlying biochemical mechanism of hydrogen production, an elementary mode analysis of acetyl-CoA pathway was performed to determine the intermediate fluxes by combining linear programming (LP) method available in CellNetAnalyzer software. We hypothesized that addition of enzymes necessary for carbon monoxide fixation and pyruvate dissimilation would enhance the theoretical yield of hydrogen. An in silico gene knockout of pyk, pykC, and mdh genes of modeled acetyl-CoA pathway allows the maximum theoretical hydrogen yield of 47.62 mmol/gCDW/h for 1 mole of carbon monoxide (CO) uptake. The obtained hydrogen yield is comparatively two times greater than the previous experimental data. Therefore, it could be concluded that this elementary flux mode analysis is a crucial way to achieve efficient hydrogen production through acetyl-CoA pathway and act as a model for strain improvement.
  • 4.

    【2hr】A Computational Approach for Predicting Role of Human MicroRNAs in MERS-CoV Genome

    包量

    机译 一种预测人类微小RNA在MERS-CoV基因组中的作用的计算方法
    摘要：The new epidemic Middle East Respiratory Syndrome (MERS) is caused by a type of human coronavirus called MERS-CoV which has global fatality rate of about 30%. We are investigating potential antiviral therapeutics against MERS-CoV by using host microRNAs (miRNAs) which may downregulate viral gene expression to quell viral replication. We computationally predicted potential 13 cellular miRNAs from 11 potential hairpin sequences of MERS-CoV genome. Our study provided an interesting hypothesis that those miRNAs, that is, hsa-miR-628-5p, hsa-miR-6804-3p, hsa-miR-4289, hsa-miR-208a-3p, hsa-miR-510-3p, hsa-miR-18a-3p, hsa-miR-329-3p, hsa-miR-548ax, hsa-miR-3934-5p, hsa-miR-4474-5p, hsa-miR-7974, hsa-miR-6865-5p, and hsa-miR-342-3p, would be antiviral therapeutics against MERS-CoV infection.
  • 5.

    【2hr】A Parallel Framework for Multipoint Spiral Search in ab Initio Protein Structure Prediction

    包量

    机译 从头算蛋白质结构预测中的多点螺旋搜索的并行框架。
    摘要：Protein structure prediction is computationally a very challenging problem. A large number of existing search algorithms attempt to solve the problem by exploring possible structures and finding the one with the minimum free energy. However, these algorithms perform poorly on large sized proteins due to an astronomically wide search space. In this paper, we present a multipoint spiral search framework that uses parallel processing techniques to expedite exploration by starting from different points. In our approach, a set of random initial solutions are generated and distributed to different threads. We allow each thread to run for a predefined period of time. The improved solutions are stored threadwise. When the threads finish, the solutions are merged together and the duplicates are removed. A selected distinct set of solutions are then split to different threads again. In our ab initio protein structure prediction method, we use the three-dimensional face-centred-cubic lattice for structure-backbone mapping. We use both the low resolution hydrophobic-polar energy model and the high-resolution 20 × 20 energy model for search guiding. The experimental results show that our new parallel framework significantly improves the results obtained by the state-of-the-art single-point search approaches for both energy models on three-dimensional face-centred-cubic lattice. We also experimentally show the effectiveness of mixing energy models within parallel threads.
  • 6.

    【2hr】Literature Mining Solutions for Life Science Research

    包量

    机译 生命科学研究的文献挖掘解决方案
    摘要：
  • 7.

    【2hr】Computational and Statistical Approaches for Modeling of Proteomic and Genomic Networks

    包量

    机译 蛋白质组学和基因组网络建模的计算和统计方法
    摘要：
  • 8.

    【2hr】Correction of Spatial Bias in Oligonucleotide Array Data

    包量

    机译 校正寡核苷酸阵列数据中的空间偏差。
    摘要：Background. Oligonucleotide microarrays allow for high-throughput gene expression profiling assays. The technology relies on the fundamental assumption that observed hybridization signal intensities (HSIs) for each intended target, on average, correlate with their target's true concentration in the sample. However, systematic, nonbiological variation from several sources undermines this hypothesis. Background hybridization signal has been previously identified as one such important source, one manifestation of which appears in the form of spatial autocorrelation. Results. We propose an algorithm, pyn, for the elimination of spatial autocorrelation in HSIs, exploiting the duality of desirable mutual information shared by probes in a common probe set and undesirable mutual information shared by spatially proximate probes. We show that this correction procedure reduces spatial autocorrelation in HSIs; increases HSI reproducibility across replicate arrays; increases differentially expressed gene detection power; and performs better than previously published methods. Conclusions. The proposed algorithm increases both precision and accuracy, while requiring virtually no changes to users' current analysis pipelines: the correction consists merely of a transformation of raw HSIs (e.g., CEL files for Affymetrix arrays). A free, open-source implementation is provided as an R package, compatible with standard Bioconductor tools. The approach may also be tailored to other platform types and other sources of bias.
  • 9.

    【2hr】Spectral Analysis on Time-Course Expression Data: Detecting Periodic Genes Using a Real-Valued Iterative Adaptive Approach

    包量

    机译 时间过程表达数据的频谱分析：使用实值迭代自适应方法检测周期基因
    摘要：Time-course expression profiles and methods for spectrum analysis have been applied for detecting transcriptional periodicities, which are valuable patterns to unravel genes associated with cell cycle and circadian rhythm regulation. However, most of the proposed methods suffer from restrictions and large false positives to a certain extent. Additionally, in some experiments, arbitrarily irregular sampling times as well as the presence of high noise and small sample sizes make accurate detection a challenging task. A novel scheme for detecting periodicities in time-course expression data is proposed, in which a real-valued iterative adaptive approach (RIAA), originally proposed for signal processing, is applied for periodogram estimation. The inferred spectrum is then analyzed using Fisher's hypothesis test. With a proper p-value threshold, periodic genes can be detected. A periodic signal, two nonperiodic signals, and four sampling strategies were considered in the simulations, including both bursts and drops. In addition, two yeast real datasets were applied for validation. The simulations and real data analysis reveal that RIAA can perform competitively with the existing algorithms. The advantage of RIAA is manifested when the expression data are highly irregularly sampled, and when the number of cycles covered by the sampling time points is very reduced.
  • 10.

    【2hr】Using Protein Clusters from Whole Proteomes to Construct and Augment a Dendrogram

    包量

    机译 使用来自整个蛋白质组的蛋白质簇构建和增强树状图
    摘要：In this paper we present a new ab initio approach for constructing an unrooted dendrogram using protein clusters, an approach that has the potential for estimating relationships among several thousands of species based on their putative proteomes. We employ an open-source software program called pClust that was developed for use in metagenomic studies. Sequence alignment is performed by pClust using the Smith-Waterman algorithm, which is known to give optimal alignment and, hence, greater accuracy than BLAST-based methods. Protein clusters generated by pClust are used to create protein profiles for each species in the dendrogram, these profiles forming a correlation filter library for use with a new taxon. To augment the dendrogram with a new taxon, a protein profile for the taxon is created using BLASTp, and this new taxon is placed into a position within the dendrogram corresponding to the highest correlation with profiles in the correlation filter library. This work was initiated because of our interest in plasmids, and each step is illustrated using proteomes from Gram-negative bacterial plasmids. Proteomes for 527 plasmids were used to generate the dendrogram, and to demonstrate the utility of the insertion algorithm twelve recently sequenced pAKD plasmids were used to augment the dendrogram.
  • 11.

    【2hr】Reverse Engineering Sparse Gene Regulatory Networks Using Cubature Kalman Filter and Compressed Sensing

    包量

    机译 使用Cubature Kalman滤波器和压缩感知的逆向工程稀疏基因调控网络
    摘要：This paper proposes a novel algorithm for inferring gene regulatory networks which makes use of cubature Kalman filter (CKF) and Kalman filter (KF) techniques in conjunction with compressed sensing methods. The gene network is described using a state-space model. A nonlinear model for the evolution of gene expression is considered, while the gene expression data is assumed to follow a linear Gaussian model. The hidden states are estimated using CKF. The system parameters are modeled as a Gauss-Markov process and are estimated using compressed sensing-based KF. These parameters provide insight into the regulatory relations among the genes. The Cramér-Rao lower bound of the parameter estimates is calculated for the system model and used as a benchmark to assess the estimation accuracy. The proposed algorithm is evaluated rigorously using synthetic data in different scenarios which include different number of genes and varying number of sample points. In addition, the algorithm is tested on the DREAM4 in silico data sets as well as the in vivo data sets from IRMA network. The proposed algorithm shows superior performance in terms of accuracy, robustness, and scalability.
  • 12.

    【2hr】Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer

    包量

    机译 用生物分子DNA计算机解决0/1背包问题
    摘要：Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular interest in solving NP-complete and hard combinatorial problems. NP-complete problems such as knapsack problem and other hard combinatorial problems can be easily solved by DNA computers in a very short period of time comparing to conventional silicon-based computers. Sticker-based DNA computing is one of the methods of DNA computing. In this paper, the sticker based DNA computing was used for solving the 0/1 knapsack problem. At first, a biomolecular solution space was constructed by using appropriate DNA memory complexes. Then, by the application of a sticker-based parallel algorithm using biological operations, knapsack problem was resolved in polynomial time.
  • 13.

    【2hr】Gene Regulation, Modulation, and Their Applications in Gene Expression Data Analysis

    包量

    机译 基因调控，调节及其在基因表达数据分析中的应用
    摘要：Common microarray and next-generation sequencing data analysis concentrate on tumor subtype classification, marker detection, and transcriptional regulation discovery during biological processes by exploring the correlated gene expression patterns and their shared functions. Genetic regulatory network (GRN) based approaches have been employed in many large studies in order to scrutinize for dysregulation and potential treatment controls. In addition to gene regulation and network construction, the concept of the network modulator that has significant systemic impact has been proposed, and detection algorithms have been developed in past years. Here we provide a unified mathematic description of these methods, followed with a brief survey of these modulator identification algorithms. As an early attempt to extend the concept to new RNA regulation mechanism, competitive endogenous RNA (ceRNA), into a modulator framework, we provide two applications to illustrate the network construction, modulation effect, and the preliminary finding from these networks. Those methods we surveyed and developed are used to dissect the regulated network under different modulators. Not limit to these, the concept of “modulation” can adapt to various biological mechanisms to discover the novel gene regulation mechanisms.
  • 14.

    【2hr】MRMPath and MRMutation, Facilitating Discovery of Mass Transitions for Proteotypic Peptides in Biological Pathways Using a Bioinformatics Approach

    包量

    机译 MRMPath和MRMutation，使用生物信息学方法促进发现生物途径中蛋白型肽的质量转变
    摘要：Quantitative proteomics applications in mass spectrometry depend on the knowledge of the mass-to-charge ratio (m/z) values of proteotypic peptides for the proteins under study and their product ions. MRMPath and MRMutation, web-based bioinformatics software that are platform independent, facilitate the recovery of this information by biologists. MRMPath utilizes publicly available information related to biological pathways in the Kyoto Encyclopedia of Genes and Genomes (KEGG) database. All the proteins involved in pathways of interest are recovered and processed in silico to extract information relevant to quantitative mass spectrometry analysis. Peptides may also be subjected to automated BLAST analysis to determine whether they are proteotypic. MRMutation catalogs and makes available, following processing, known (mutant) variants of proteins from the current UniProtKB database. All these results, available via the web from well-maintained, public databases, are written to an Excel spreadsheet, which the user can download and save. MRMPath and MRMutation can be freely accessed. As a system that seeks to allow two or more resources to interoperate, MRMPath represents an advance in bioinformatics tool development. As a practical matter, the MRMPath automated approach represents significant time savings to researchers.
  • 15.

    【2hr】Identification of Robust Pathway Markers for Cancer through Rank-Based Pathway Activity Inference

    包量

    机译 通过基于等级的途径活性推断鉴定癌症的稳健途径标记
    摘要：One important problem in translational genomics is the identification of reliable and reproducible markers that can be used to discriminate between different classes of a complex disease, such as cancer. The typical small sample setting makes the prediction of such markers very challenging, and various approaches have been proposed to address this problem. For example, it has been shown that pathway markers, which aggregate the gene activities in the same pathway, tend to be more robust than gene markers. Furthermore, the use of gene expression ranking has been demonstrated to be robust to batch effects and that it can lead to more interpretable results. In this paper, we propose an enhanced pathway activity inference method that uses gene ranking to predict the pathway activity in a probabilistic manner. The main focus of this work is on identifying robust pathway markers that can ultimately lead to robust classifiers with reproducible performance across datasets. Simulation results based on multiple breast cancer datasets show that the proposed inference method identifies better pathway markers that can predict breast cancer metastasis with higher accuracy. Moreover, the identified pathway markers can lead to better classifiers with more consistent classification performance across independent datasets.
  • 16.

    【2hr】Comparing Imputation Procedures for Affymetrix Gene Expression Datasets Using MAQC Datasets

    包量

    机译 使用MAQC数据集比较Affymetrix基因表达数据集的插补程序
    摘要：Introduction. The microarray datasets from the MicroArray Quality Control (MAQC) project have enabled the assessment of the precision, comparability of microarrays, and other various microarray analysis methods. However, to date no studies that we are aware of have reported the performance of missing value imputation schemes on the MAQC datasets. In this study, we use the MAQC Affymetrix datasets to evaluate several imputation procedures in Affymetrix microarrays. Results. We evaluated several cutting edge imputation procedures and compared them using different error measures. We randomly deleted 5% and 10% of the data and imputed the missing values using imputation tests. We performed 1000 simulations and averaged the results. The results for both 5% and 10% deletion are similar. Among the imputation methods, we observe the local least squares method with k = 4 is most accurate under the error measures considered. The k-nearest neighbor method with k = 1 has the highest error rate among imputation methods and error measures. Conclusions. We conclude for imputing missing values in Affymetrix microarray datasets, using the MAS 5.0 preprocessing scheme, the local least squares method with k = 4 has the best overall performance and k-nearest neighbor method with k = 1 has the worst overall performance. These results hold true for both 5% and 10% missing values.
  • 17.

    【2hr】Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases

    包量

    机译 在EST数据库中选择唯一寡核苷酸的高效串行和并行算法
    摘要：Obtaining unique oligos from an EST database is a problem of great importance in bioinformatics, particularly in the discovery of new genes and the mapping of the human genome. Many algorithms have been developed to find unique oligos, many of which are much less time consuming than the traditional brute force approach. An algorithm was presented by Zheng et al. (2004) which finds the solution of the unique oligos search problem efficiently. We implement this algorithm as well as several new algorithms based on some theorems included in this paper. We demonstrate how, with these new algorithms, we can obtain unique oligos much faster than with previous ones. We parallelize these new algorithms to further improve the time of finding unique oligos. All algorithms are run on ESTs obtained from a Barley EST database.
  • 18.

    【2hr】Statistical Analysis of Terminal Extensions of Protein β-Strand Pairs

    包量

    机译 蛋白β-链对末端延伸的统计分析
    摘要：The long-range interactions, required to the accurate predictions of tertiary structures of β-sheet-containing proteins, are still difficult to simulate. To remedy this problem and to facilitate β-sheet structure predictions, many efforts have been made by computational methods. However, known efforts on β-sheets mainly focus on interresidue contacts or amino acid partners. In this study, to go one step further, we studied β-sheets on the strand level, in which a statistical analysis was made on the terminal extensions of paired β-strands. In most cases, the two paired β-strands have different lengths, and terminal extensions exist. The terminal extensions are the extended part of the paired strands besides the common paired part. However, we found that the best pairing required a terminal alignment, and β-strands tend to pair to make bigger common parts. As a result, 96.97%  of β-strand pairs have a ratio of 25% of the paired common part to the whole length. Also 94.26% and 95.98%  of β-strand pairs have a ratio of 40% of the paired common part to the length of the two β-strands, respectively. Interstrand register predictions by searching interacting β-strands from several alternative offsets should comply with this rule to reduce the computational searching space to improve the performances of algorithms.
  • 19.

    【2hr】A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks

    包量

    机译 用于生物网络可视化的多级伽马聚类布局算法
    摘要：Visualization of large complex networks has become an indispensable part of systems biology, where organisms need to be considered as one complex system. The visualization of the corresponding network is challenging due to the size and density of edges. In many cases, the use of standard visualization algorithms can lead to high running times and poorly readable visualizations due to many edge crossings. We suggest an approach that analyzes the structure of the graph first and then generates a new graph which contains specific semantic symbols for regular substructures like dense clusters. We propose a multilevel gamma-clustering layout visualization algorithm (MLGA) which proceeds in three subsequent steps: (i) a multilevel γ-clustering is used to identify the structure of the underlying network, (ii) the network is transformed to a tree, and (iii) finally, the resulting tree which shows the network structure is drawn using a variation of a force-directed algorithm. The algorithm has a potential to visualize very large networks because it uses modern clustering heuristics which are optimized for large graphs. Moreover, most of the edges are removed from the visual representation which allows keeping the overview over complex graphs with dense subgraphs.
  • 20.

    【2hr】An Overview of the Statistical Methods Used for Inferring Gene Regulatory Networks and Protein-Protein Interaction Networks

    包量

    机译 推断基因调控网络和蛋白质-蛋白质相互作用网络的统计方法概述
    摘要：The large influx of data from high-throughput genomic and proteomic technologies has encouraged the researchers to seek approaches for understanding the structure of gene regulatory networks and proteomic networks. This work reviews some of the most important statistical methods used for modeling of gene regulatory networks (GRNs) and protein-protein interaction (PPI) networks. The paper focuses on the recent advances in the statistical graphical modeling techniques, state-space representation models, and information theoretic methods that were proposed for inferring the topology of GRNs. It appears that the problem of inferring the structure of PPI networks is quite different from that of GRNs. Clustering and probabilistic graphical modeling techniques are of prime importance in the statistical inference of PPI networks, and some of the recent approaches using these techniques are also reviewed in this paper. Performance evaluation criteria for the approaches used for modeling GRNs and PPI networks are also discussed.
题名 作者 来源 发表时间

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号