检索结果-内蒙古大学图书馆

Lecture Notes in Computer Science

作者： Patro, Rob Sefer, Emre Malin, Justin Marçais, Guillaume Navlakha, Saket Kingsford, Carl Center for Bioinformatics and Computational Biology University of Maryland College Park MD 20742 United States Department of Computer Science University of Maryland College Park MD 20742 United States Computational Biology Bioinformatics and Genomics Concentration Biological Sciences Graduate Program University of Maryland College Park MD 20742 United States Program in Applied Mathematics Statistics and Scientific Computation University of Maryland College Park MD 20742 United States School of Computer Science Carnegie Mellon University Pittsburgh PA 15213 United States

ISBN: (纸本)9783642230370

We consider the problem of reconstructing a maximally parsimonious history of network evolution under models that support gene duplication and loss and independent interaction gain and loss. We introduce a combinatorial framework for encoding network histories, and we give a fast procedure that, given a set of duplication histories, in practice finds network histories with close to the minimum number of interaction gain or loss events. In contrast to previous studies, our method does not require knowing the relative ordering of unrelated duplication events. Results on simulated histories suggest that common ancestral networks can be accurately reconstructed using this parsimony approach. © 2011 Springer-Verlag.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

A pathway-based kernel boosting method for sample classification using genomic data

arXiv

引用

arXiv 2018年

作者： Zeng, Li Yu, Zhaolong Zhao, Hongyu Department of Biostatistics Yale University New HavenCT06511 United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University New HavenCT06511 United States

The analysis of cancer genomic data has long suffered "the curse of dimensionality". Sample sizes for most cancer genomic studies are a few hundreds at most while there are tens of thousands of genomic features studied. Various methods have been proposed to leverage prior biological knowledge, such as pathways, to more effectively analyze cancer genomic data. Most of the methods focus on testing marginal significance of the associations between pathways and clinical phenotypes. They can identify relevant pathways, but do not involve predictive modeling. In this article, we propose a Pathway-based Kernel Boosting (PKB) method for integrating gene pathway information for sample classification, where we use kernel functions calculated from each pathway as base learners and learn the weights through iterative optimization of the classifica- tion loss function. We apply PKB and several competing methods to three cancer studies with pathological and clinical information, including tumor grade, stage, tumor sites, and metastasis status. Our results show that PKB outperforms other methods, and identifies pathways relevant to the outcome variables. Copyright © 2018, The Authors. All rights reserved.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

AI solutions for drafting in Magic: The gathering

arXiv

引用

arXiv 2020年

作者： Ward, Henry N. Brooks, Daniel J. Troha, Dan Mills, Bobby Khakhalin, Arseny S. Bioinformatics and Computational Biology Graduate Program University of Minnesota MinneapolisMN United States *** San DiegoCA United States Biology Program Bard College Annandale-on-HudsonNY United States

Drafting in Magic the Gathering is a sub-game within a larger trading card game, where several players progressively build decks by picking cards from a common pool. Drafting poses an interesting problem for game and AI research due to its large search space, mechanical complexity, multiplayer nature, and hidden information. Despite this, drafting remains understudied, in part due to a lack of high-quality, public datasets. To rectify this problem, we present a dataset of over 100,000 simulated, anonymized human drafts collected from ***. We also propose four diverse strategies for drafting agents, including a primitive heuristic agent, an expert-tuned complex heuristic agent, a Naive Bayes agent, and a deep neural network agent. We benchmark their ability to emulate human drafting, and show that the deep neural network agent outperforms other agents, while the Naive Bayes and expert-tuned agents outperform simple heuristics. We analyze the accuracy of AI agents across the timeline of a draft, and describe unique strengths and weaknesses for each approach. This work helps to identify next steps in the creation of humanlike drafting agents, and can serve as a benchmark for the next generation of drafting bots. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Study of Classification Techniques Based on Spike Protein Sequences of MERS-CoV 23

A Study of Classification Techniques Based on Spike Protein ...

引用

Proceedings of the 2023 10th International Conference on Biomedical and bioinformatics Engineering

作者： Hayeon Kim Myeongji Cho Hyeon S. Son Laboratory of Computational Biology & Bioinformatics Graduate School of Public Health Seoul National University Republic of Korea and Institute of Health and Environment Seoul National University Republic of Korea Laboratory of Computational Biology & Bioinformatics Graduate School of Public Health Seoul National University Republic of Korea Laboratory of Computational Biology & Bioinformatics Graduate School of Public Health Seoul National University Republic of Korea Institute of Health and Environment Seoul National University Republic of Korea and Interdisciplinary Graduate Program in Bioinformatics College of Natural Science Seoul National University Republic of Korea

ISBN: (纸本)9798400708343

MERS-CoV, which belongs to the beta-coronaviruses together with SARS-CoV-2, although it has received relatively less attention by the COVID-19 pandemic, there is a sufficient possibility of new MERS-CoV lineages and variants. Previous studies have discussed the possibility of frequent recombination of MERS-CoV. We thus present a highly accurate method for the phylogenetic analysis and classification of MERS-CoV including recombinant sequences. We collected the sequences of S protein from MERS-CoV and divided them into five phylogenetic groups, of which recombinant sequences were divided into seven types. Physicochemical properties of amino acids were then calculated from the S protein sequences, and the results were used for the random forest model, Naïve Bayes classification, and k-nearest neighbor method. We also constructed several feature subsets based on the ranked amino acid properties and applied them to the random forest model. In each dataset, the amino acid physicochemical properties were ranked differently. Using this information, classification of MERS-CoV based on machine learning algorithms showed that the random forest model had the best accuracy and area under the curve compared with the k-nearest neighbor and Naïve Bayes classification methods. Several feature subsets were constructed using the correlation feature selection algorithm and applied to the random forest model. Overall, the performance of the classifier was improved compared to that when using all features. Coronaviruses including MERS-CoV continue to evolve into new forms through recombination or mutation. We thus present a method to increase the accuracy of their classification using additional information of the viral protein sequence, and confirm that a subunit consisting of optimal prominent features can improve the performance of the classifier by removing the unnecessary characteristic information.

关键词： MERS-CoV classification machine learning

来源：评论

学校读者我要写书评

暂无评论

Free energies for coarse-grained proteins by integrating multibody statistical contact potentials with entropies from elastic network models

引用

Journal of Structural and Functional Genomics 2011年第2期12卷 137-147页

作者： Zimmermann, Michael T. Leelananda, Sumudu P. Gniewek, Pawel Feng, Yaping Jernigan, Robert L. Kloczkowski, Andrzej Department of Biochemistry Biophysics and Molecular Biology Iowa State University Ames IA 50011-0320 United States L.H.Baker Center for Bioinformatics and Biological Statistics Iowa State University Ames IA 50011-3020 United States Bioinformatics and Computational Biology Interdepartmental Graduate Program Iowa State University Ames IA 50011 United States Laboratory of Theory of Biopolymers Faculty of Chemistry University of Warsaw 02-093 Warsaw Pasteura 1 Poland Battelle Center for Mathematical Medicine Research Institute at Nationwide Children's Hospital Columbus OH 43205 United States Department of Pediatrics Ohio State University College of Medicine Columbus OH 43205 United States

We propose a novel method of calculation of free energy for coarse grained models of proteins by combining our newly developed multibody potentials with entropies computed from elastic network models of proteins. Multi-body potentials have been of much interest recently because they take into account three dimensional interactions related to residue packing and capture the cooperativity of these interactions in protein structures. Combining four-body non-sequential, four-body sequential and pairwise short range potentials with optimized weights for each term, our coarse-grained potential improved recognition of native structure among misfolded decoys, outperforming all other contact potentials for CASP8 decoy sets and performance comparable to the fully atomic empirical DFIRE potentials. By combing statistical contact potentials with entropies from elastic network models of the same structures we can compute free energy changes and improve coarse-grained modeling of protein structure and dynamics. The consideration of protein flexibility and dynamics should improve protein structure prediction and refinement of computational models. This work is the first to combine coarse-grained multibody potentials with an entropic model that takes into account contributions of the entire structure, investigating native-like decoy selection. © 2011 Springer Science+Business Media B.V.

关键词： 4-Body potentials Elastic network models Multibody potentials Protein dynamics Protein structure prediction Protein structure refinement

来源：评论

学校读者我要写书评

暂无评论

Characterization of the retinal proteome during rod photoreceptor genesis

引用

BMC Research Notes 2010年第1期3卷 1-8页

作者： Barnhill, Alison E Hecker, Laura A Kohutyuk, Oksana Buss, Janice E Honavar, Vasant G Greenlee, Heather West Interdepartmental Neuroscience Program Iowa State University Ames IA United States Department of Biomedical Sciences Iowa State University Ames IA United States Bioinformatics and Computational Biology Program Iowa State University Ames IA United States Department of Biochemistry Biophysics and Molecular Biology Iowa State University Ames IA United States Department of Computer Science Iowa State University Ames IA United States National Animal Disease Center Ames IA 50010 United States Mayo Clinic Department of Ophthalmology Rochester MN 55905 United States

Background. The process of rod photoreceptor genesis, cell fate determination and differentiation is complex and multi-factorial. Previous studies have defined a model of photoreceptor differentiation that relies on intrinsic changes within the presumptive photoreceptor cells as well as changes in surrounding tissue that are extrinsic to the cell. We have used a proteomics approach to identify proteins that are dynamically expressed in the mouse retina during rod genesis and differentiation. Findings. A series of six developmental ages from E13 to P5 were used to define changes in retinal protein expression during rod photoreceptor genesis and early differentiation. Retinal proteins were separated by isoelectric focus point and molecular weight. Gels were analyzed for changes in protein spot intensity across developmental time. Protein spots that peaked in expression at E17, P0 and P5 were picked from gels for identification. There were 239 spots that were picked for identification based on their dynamic expression during the developmental period of maximal rod photoreceptor genesis and differentiation. Of the 239 spots, 60 of them were reliably identified and represented a single protein. Ten proteins were represented by multiple spots, suggesting they were post-translationally modified. Of the 42 unique dynamically expressed proteins identified, 16 had been previously reported to be associated with the developing retina. Conclusions. Our results represent the first proteomics study of the developing mouse retina that includes prenatal development. We identified 26 dynamically expressed proteins in the developing mouse retina whose expression had not been previously associated with retinal development. © 2010 Greenlee et al.;licensee BioMed Central Ltd.

关键词： Protein Spot Mouse Retina Retinal Development Retinal Protein Probability Base Mowse Score

来源：评论

学校读者我要写书评

暂无评论

Local two-sample testing over graphs and point-clouds by random-walk distributions

arXiv

引用

arXiv 2020年

作者： Landa, Boris Qu, Rihao Chang, Joseph Kluger, Yuval Program in Applied Mathematics Yale University Department of Pathology Yale University School of Medicine Department of Statistics and Data Science Yale University Interdepartmental Program in Computational Biology and Bioinformatics Yale University Department of Immunology Yale School of Medicine

Rejecting the null hypothesis in two-sample testing is a fundamental tool for scientific discovery. Yet, aside from concluding that two samples do not come from the same probability distribution, it is often of interest to characterize how the two distributions differ. Given samples from two densities f1and f0, we consider the task of localizing occurrences of the inequality f1> f0. To avoid the challenges associated with high-dimensional space, we propose a general hypothesis testing framework where hypotheses are formulated adaptively to the data by conditioning on the combined sample from the two densities. We then investigate a special case of this framework where the notion of locality is captured by a random walk on a weighted graph constructed over this combined sample. We derive a tractable testing procedure for this case employing a type of scan statistic, and provide non-asymptotic lower bounds on the power and accuracy of our test to detect whether f1> f0in a local sense. Furthermore, we characterize the test's consistency according to a certain problem-hardness parameter, and show that our test achieves the minimax detection rate for this parameter. We conduct numerical experiments to validate our method, and demonstrate our approach on two real-world applications: detecting and localizing arsenic well contamination across the United States, and analyzing two-sample single-cell RNA sequencing data from melanoma *** Codes 62G10 Copyright © 2020, The Authors. All rights reserved.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Identify Non-mutational p53 Functional Deficiency in Human Cancers

引用

Genomics, Proteomics & bioinformatics 2024年第5期22卷 85-98页

作者： Qianpeng Li Yang Zhang Sicheng Luo Zhang Zhang Ann L.Oberg David E.Kozono Hua Lu Jann N.Sarkaria Lina Ma Liguo Wang National Genomics Data Center China National Center for BioinformationBeijing 100101China Beijing Institute of Genomics Chinese Academy of SciencesBeijing 100101China University of Chinese Academy of Sciences Beijing 100049China Division of Computational Biology Mayo Clinic College of Medicine and ScienceRochesterMN 55905USA Department of Radiation Oncology Dana-Farber Cancer Institute and Brigham and Women's HospitalBostonMA 02215USA Department of Biochemistry&Molecular Biology and Tulane Cancer Center Tulane University School of MedicineNew OrleansLA 70112USA Department of Radiation Oncology Mayo Clinic College of Medicine and ScienceRochesterMN 55905USA Department of Biochemistry and Molecular Biology Mayo Clinic College of Medicine and ScienceRochesterMN 55905USA Bioinformatics and Computational Biology Graduate Program University of Minnesota RochesterRochesterMN 55904USA

An accurate assessment of p53's functional statuses is critical for cancer genomic ***,there is a significant challenge in identifying tumors with non-mutational p53 inactivation which is not detectable through DNA *** undetected cases are often misclassified as p53-normal,leading to inaccurate prognosis and downstream association *** address this issue,we built the support vector machine(SVM)models to systematically reassess p53's functional statuses in TP53 wild-type(TP53^(WT))tumors from multiple The Cancer Genome Atlas(TCGA)***-validation demonstrated the good performance of the SVM models with a mean area under the receiver operating characteristic curve(AUROC)of 0.9822,precision of 0.9747,and recall of *** study revealed that a significant proportion(87%-99%)of TP53^(WT) tumors actually had compromised p53 *** analyses uncovered that these genetically intact but functionally impaired(termed as predictively reduced function of p53 or TP53^(WT)-pRF)tumors exhibited genomic and pathophysiologic features akin to TP53-mutant tumors:heightened genomic instability and elevated levels of ***,patients with TP53^(WT)-pRF tumors experienced significantly shortened overall survival or progression-free survival compared to those with predictively normal function of p53(TP53^(WT)-pN)tumors,and these patients also displayed increased sensitivity to platinum-based chemotherapy and radiation therapy.

关键词： Cancer Composite expression DNA mutation Machine learning p53 deficiency

来源：评论

学校读者我要写书评

暂无评论

Analysis of cancer omics data in a semantic web framework

Analysis of cancer omics data in a semantic web framework

引用

Workshop on Semantic Web Applications and Tools for Life Sciences 2010, SWAT4LS 2010

作者： Holford, Matthew E. McCusker, James P. Cheung, Kei-Hoi Krauthammer, Michael Interdepartmental Program in Computational Biology and Bioinformatics Yale University New Haven CT United States Department of Pathology Yale University New Haven CT United States Department of Computer Science Yale University New Haven CT United States Center for Medical Informatics Yale University New Haven CT United States Department of Genetics Yale University New Haven CT United States

Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and its response to anti-cancer therapy. To study the problem, we have previously focused on data warehousing technologies and statistical data integration. In this paper, we present recent work on extending our analytical capabilities using Semantic Web technology. A key new component presented here is a SPARQL endpoint to our existing data warehouse. This endpoint allows the merging of observed quantitative data with existing data from semantic knowledge sources such as Gene Ontology (GO). We show how such variegated quantitative and functional data can be integrated and accessed in a universal manner using Semantic Web tools. We also demonstrate how Description Logic (DL) reasoning can be used to infer previously unstated conclusions from existing knowledge bases. As proof of concept, we illustrate the ability of our setup to answer complex queries on resistance of cancer cells to Decitabine, a demethylating agent.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Formalizing the representation of immune exposures for human immunology studies 9

Formalizing the representation of immune exposures for human...

引用

9th International Conference on Biological Ontology, ICBO 2018

作者： Vita, Randi Overton, James A. Cheung, Kei-Hoi Kleinstein, Steven H. Peters, Bjoern Division for Vaccine Discovery San Diego Institute for Allergy and Immunology San DiegoCA United States Department of Emergency Medicine Yale Center for Medical Informatics Yale School of Medicine New HavenCT United States Department of Pathology Yale School of Medicine New HavenCT United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University New HavenCT United States

Human immunology studies typically examine how immune exposures associated with vaccinations, infectious, allergic or autoimmune diseases, or transplantations perturb the immune system with the goal to develop diagnostic tools and therapeutic interventions. While there are established approaches to formally represent the experimental data generated in such studies, which often comprises gene expression data, flow cytometry data, or serology data, the description of the immune exposures themselves is not well standardized. We here present a formal approach to represent immune exposures at a high level of granularity. We capture the exposure process (e.g. 'vaccination' or 'occurrence of allergic disease'), exposure material (e.g. 'Tdap vaccine' or 'House dust mite'), and the associated disease name and stage (e.g. 'allergic rhinitis' and 'chronic'). This representation scheme has been used successfully in the IEDB and an extended version has been adopted by HIPC to capture studies in ImmPort. We are reporting here on this scheme, our ongoing attempts to map the terms used to existing ontologies, and the challenges encountered. © 2018 CEUR-WS.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：