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

Addendum: The FAIR Guiding Principles for scientific data management and stewardship

Scientific data 2019年第1期6卷 6页

作者： Mark D Wilkinson Michel Dumontier Ijsbrand Jan Aalbersberg Gabrielle Appleton Myles Axton Arie Baak Niklas Blomberg Jan-Willem Boiten Luiz Bonino da Silva Santos Philip E Bourne Jildau Bouwman Anthony J Brookes Tim Clark Mercè Crosas Ingrid Dillo Olivier Dumon Scott Edmunds Chris T Evelo Richard Finkers Alejandra Gonzalez-Beltran Alasdair J G Gray Paul Groth Carole Goble Jeffrey S Grethe Jaap Heringa Peter A C 't Hoen Rob Hooft Tobias Kuhn Ruben Kok Joost Kok Scott J Lusher Maryann E Martone Albert Mons Abel L Packer Bengt Persson Philippe Rocca-Serra Marco Roos Rene van Schaik Susanna-Assunta Sansone Erik Schultes Thierry Sengstag Ted Slater George Strawn Morris A Swertz Mark Thompson Johan van der Lei Erik van Mulligen Andra Waagmeester Peter Wittenburg Katherine Wolstencroft Jun Zhao Barend Mons Center for Plant Biotechnology and Genomics Universidad Politécnica de Madrid Madrid 28223 Spain. Stanford University Stanford 94305-5411 USA. Elsevier Amsterdam 1043 NX The Netherlands. Nature Genetics New York 10004-1562 USA. Euretos and Phortos Consultants Rotterdam 2741 CA The Netherlands. ELIXIR Wellcome Genome Campus Hinxton CB10 1SA UK. Lygature Eindhoven 5656 AG The Netherlands. Vrije Universiteit Amsterdam Dutch Techcenter for Life Sciences Amsterdam 1081 HV The Netherlands. Office of the Director National Institutes of Health Rockville 20892 USA. TNO Zeist 3700 AJ The Netherlands. Department of Genetics University of Leicester Leicester LE1 7RH UK. Harvard Medical School Boston Massachusetts MA 02115 USA. Harvard University Cambridge Massachusetts MA 02138 USA. Data Archiving and Networked Services (DANS) The Hague 2593 HW The Netherlands. GigaScience Beijing Genomics Institute Shenzhen 518083 China. Department of Bioinformatics Maastricht University Maastricht 6200 MD The Netherlands. Wageningen UR Plant Breeding Wageningen 6708 PB The Netherlands. Oxford e-Research Center University of Oxford Oxford OX1 3QG UK. Heriot-Watt University Edinburgh EH14 4AS UK. School of Computer Science University of Manchester Manchester M13 9PL UK. Center for Research in Biological Systems School of Medicine University of California San Diego La Jolla California 92093-0446 USA. Dutch Techcenter for the Life Sciences Utrecht 3501 DE The Netherlands. Department of Human Genetics Leiden University Medical Center Dutch Techcenter for the Life Sciences Leiden 2300 RC The Netherlands. Dutch TechCenter for Life Sciences and ELIXIR-NL Utrecht 3501 DE The Netherlands. VU University Amsterdam Amsterdam 1081 HV The Netherlands. Leiden Center of Data Science Leiden University Leiden 2300 RA The Netherlands. Netherlands eScience Center Amsterdam 1098 XG The Netherlands. National Center for Microscopy and Imaging Research UCSD San Di

来源：评论

学校读者我要写书评

暂无评论

FAST: Fast annotation with synchronized threads

FAST: Fast annotation with synchronized threads

引用

IEEE Symposium on Computational Intelligence and bioinformatics and Computational Biology (CIBCB)

作者： Dongjae Kim Aria S. Hahn Niels W. Hanson Kishori M. Konwar Steven J. Hallam Department of Computer Science University of British Columbia Vancouver BC Canada Koonkie Inc. Menlo Park CA USA Department of Microbiology & Immunology University of British Columbia Vancouver BC Canada Data & Analytics KPMG LLC Seattle WA USA Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA USA Graduate Program in Bioinformatics University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781509000128

FAST is a multi-threaded, I/O optimized Seed-and-Extend alignment program. FAST is extensible to nucleotide sequences making it comparable to both BLASTn and BLASTp, and also features several new usage flags reporting only HSPs meeting user defined e-value cut-offs. FASTs threaded database construction allows fast, low memory database construction e.g., RefSeq (9.4GB) can be indexed in under 5 minutes using 20 threads. The threaded database construction gives users the ability to create custom databases on demand which is useful for tasks requiring self-alignment, such as network construction [30]. Finally, FAST supports incremental database construction enabling users to keep their databases up-to-date by adding sequences without suffering the cost of reformatting the entire database. The FAST source is freely available through GitHub https:// ***/hallamlab/FAST and test datasets can be found on Dropbox https://***/sh/xvvavweuzgqybc4/ AAAWCrRnol67ZsXi2qLQWUuOa?

关键词： Instruction sets Synchronization Random access memory Algorithm design and analysis Data structures Indexes

来源：评论

学校读者我要写书评

暂无评论

Finding function in the unknown

Finding function in the unknown

引用

IEEE International Conference on bioinformatics and Biomedicine, BIBM 2015

作者： Boyd, Kelly Highland, Emma Misch, Amanda Hu, Amber Reddy, Sushma Putonti, Catherine Department of Biology Bioinformatics Program Loyola University Chicago ChicagoIL60660 United States Stevenson High School LincolnshireIL60069 United States Departments of Biology and Computer Science Bioinformatics Program Loyola University Chicago ChicagoIL60660 United States

ISBN: (纸本)9781467367981

Through high-throughput RNA sequencing (RNAseq), transcriptomes for a single cell, tissue, or organism(s) can be ascertained at a high resolution. While a number of bioinformatic tools have been developed for transcriptome analyses, significant challenges exist for studies of non-model organisms. Without a reference sequence available, raw reads must first be assembled de novo followed by the tedious task of BLAST searches and data mining for functional information. We have created a pipeline, PyRanger, to automate this process. The pipeline includes functionality to assess a single transcriptome and also facilitate comparative transcriptomic studies. © 2015 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “PlantMirnaT: miRNA and mRNA integrated analysis fully utilizing characteristics of plant sequencing data” [Methods 83 (2015) 80–87]

引用

Methods 2016年 92卷 94-94页

作者： S. Rhee H. Chae S. Kim Department of Computer Science and Engineering Seoul National University Seoul Republic of Korea School of Informatics and Computing Computer Science Department Indiana University Bloomington IN USA Bioinformatics Institute Seoul National University Seoul Republic of Korea Interdisciplinary Program in Bioinformatics Seoul National University Seoul Republic of Korea

来源：评论

学校读者我要写书评

暂无评论

Cover Image, Volume 84, Issue 12

引用

Proteins: Structure, Function, and bioinformatics 2016年第12期84卷

作者： Hyuntae Na Guang Song Department of Computer Science Penn State Harrisburg Middletown Pennsylvania 17057 Department of Computer Science Iowa State University Ames Iowa 50011 Program of Bioinformatics and Computational Biology Iowa State University Ames Iowa 50011 L. H. Baker Center for Bioinformatics and Biological Statistics Iowa State University Ames Iowa 50011

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: Alpha-synuclein facilitates to form short unconventional microtubules that have a unique function in the axonal transport

引用

Scientific reports 2018年第1期8卷 8019页

作者： Shiori Toba Mingyue Jin Masami Yamada Kanako Kumamoto Sakiko Matsumoto Takuo Yasunaga Yuko Fukunaga Atsuo Miyazawa Sakiko Fujita Kyoko Itoh Shinji Fushiki Hiroaki Kojima Hideki Wanibuchi Yoshiyuki Arai Takeharu Nagai Shinji Hirotsune Department of Genetic Disease Research Osaka City University Graduate School of Medicine Asahi-machi 1-4-3 Abeno Osaka 545-8585 Japan. Department of Bioscience and Bioinformatics Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-850 Japan. JST-SENTAN 4-1-8 Honcho Kawaguchi Saitama 332-0012 Japan. JST-CREST 4-1-8 Honcho Kawaguchi Saitama 332-0012 Japan. Graduate School of Life Science University of Hyogo 3-2-1 Kouto Kamigori-cho Ako-gun Hyogo 678-1297 Japan. RSC-University of Hyogo Leading Program Center RIKEN SPring-8 Center 1-1-1 Kouto Sayo-cho Sayo-gun Hyogo 679-5148 Japan. Graduate School of Materials Science Nara Institute of Science and Technology 8916-5 Takayama Ikoma Nara 630-0101 Japan. Department of Pathology and Applied Neurobiology Kyoto Prefectural University of Medicine Graduate School of Medical Sciences Kajii-cho Kawaramachi-Hirokoji Kamigyo-ku Kyoto 602-8566 Japan. Advanced ICT Research Institute National Institute of Information and Communications Technology 588-2 Iwaoka Nishi-ku Kobe 651-2492 Japan. Department of Pathology Osaka City University Graduate School of Medicine Asahi-machi 1-4-3 Abeno Osaka 545-8586 Japan. Department of Biomolecular Science and Engineering Institute of Scientific and Industrial Research Osaka University Mihoga-oka 8-1 Osaka 567-0047 Japan. Department of Genetic Disease Research Osaka City University Graduate School of Medicine Asahi-machi 1-4-3 Abeno Osaka 545-8585 Japan. shinjih@med.osaka-cu.ac.jp.

A correction to this article has been published and is linked from the HTML and PDF versions of this paper. The error has not been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bayesian group factor analysis with structured sparsity

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2016年第1期17卷

作者： Kevin Murphy Bernhard Schölkopf Shiwen Zhao Chuan Gao Sayan Mukherjee Barbara E. Engelhardt Google MPI for Intelligent Systems Computational Biology and Bioinformatics Program Department of Statistical Science Duke University Durham NC Department of Statistical Science Duke University Durham NC Departments of Statistical Science Computer Science Mathematics Duke University Durham NC Department of Computer Science Center for Statistics and Machine Learning Princeton University Princeton NJ

Latent factor models are the canonical statistical tool for exploratory analyses of low-dimensional linear structure for a matrix of p features across n samples. We develop a structured Bayesian group factor analysis model that extends the factor model to multiple coupled observation matrices; in the case of two observations, this reduces to a Bayesian model of canonical correlation analysis. Here, we carefully define a structured Bayesian prior that encourages both element-wise and column-wise shrinkage and leads to desirable behavior on high-dimensional data. In particular, our model puts a structured prior on the joint factor loading matrix, regularizing at three levels, which enables element-wise sparsity and unsupervised recovery of latent factors corresponding to structured variance across arbitrary subsets of the observations. In addition, our structured prior allows for both dense and sparse latent factors so that covariation among either all features or only a subset of features can be recovered. We use fast parameter-expanded expectation-maximization for parameter estimation in this model. We validate our method on simulated data with substantial structure. We show results of our method applied to three high-dimensional data sets, comparing results against a number of state-of-the-art approaches. These results illustrate useful properties of our model, including i) recovering sparse signal in the presence of dense effects; ii) the ability to scale naturally to large numbers of observations; iii) flexible observation- and factor-specific regularization to recover factors with a wide variety of sparsity levels and percentage of variance explained; and iv) tractable inference that scales to modern genomic and text data sizes.

关键词： bayesian structured sparsity canonical correlation analysis mixture models parameter expansion sparse and low-rank matrix decomposition sparse priors

来源：评论

学校读者我要写书评

暂无评论

FragGeneScan-plus for scalable high-throughput short-read open reading frame prediction

FragGeneScan-plus for scalable high-throughput short-read op...

引用

IEEE Symposium on Computational Intelligence and bioinformatics and Computational Biology (CIBCB)

作者： Dongjae Kim Aria S. Hahn Shang-Ju Wu Niels W. Hanson Kishori M. Konwar Steven J. Hallam Department of Computer Science University of British Columbia Vancouver Canada Department of Microbiology University of British Columbia Vancouver Canada Graduate Program in Bioinformatics University of British Columbia Vancouver Canada

A fundamental step in the analysis of environmental sequence information is the prediction of potential genes or open reading frames (ORFs) encoding the metabolic potential of individual cells and entire microbial communities. FragGeneScan, a software designed to predict intact and incomplete ORFs on short sequencing reads combines codon usage bias, sequencing error models and start/stop codon patterns in a hidden Markov model to find the most likely path of hidden states from a given input sequence, provides a promising route for gene recovery in environmental datasets with incomplete assemblies. However, the current implementation of FragGeneScan does not scale efficiently with increasing input data size. Thus, FragGeneScan cannot be applied to contemporary environmental datasets that can exceed 100s of Gb. Here, we present FragGeneScan-Plus, an improved implementation of the FragGeneScan gene prediction model that leverages algorithmic thread synchronization and efficient in-memory data management to utilize multiple CPU cores without blocking I/O operations. FragGeneScan-Plus can process data approximately 5-times faster than FragGeneScan using a single core and approximately 50-times faster using eight hyper-threaded cores when benchmarked against simulated and real world environmental datasets.

关键词： Instruction sets Buffer storage Hidden Markov models Synchronization Predictive models Prediction algorithms Soil

来源：评论

学校读者我要写书评

暂无评论

Creation and analysis of biochemical constraint-based models: The COBRA Toolbox v3.0

arXiv

引用

arXiv 2017年

作者： Heirendt, Laurent Arreckx, Sylvain Pfau, Thomas Mendoza, Sebastián N. Richelle, Anne Heinken, Almut Haraldsdóttir, Hulda S. Wachowiak, Jacek Keating, Sarah M. Vlasov, Vanja Magnusdóttir, Stefania Ng, Chiam Yu Preciat, German Žagare, Alise Chan, Siu H.J. Aurich, Maike K. Clancy, Catherine M. Modamio, Jennifer Sauls, John T. Noronha, Alberto Bordbar, Aarash Cousins, Benjamin El Assal, Diana C. Valcarcel, Luis V. Apaolaza, Iñigo Ghaderi, Susan Ahookhosh, Masoud Guebila, Marouen Ben Kostromins, Andrejs Sompairac, Nicolas Le, Hoai M. Ma, Ding Sun, Yuekai Wang, Lin Yurkovich, James T. Oliveira, Miguel A.P. Vuong, Phan T. El Assal, Lemmer P. Kuperstein, Inna Zinovyev, Andrei Scott Hinton, H. Bryant, William A. Aragón Artacho, Francisco J. Planes, Francisco J. Stalidzans, Egils Maass, Alejandro Vempala, Santosh Hucka, Michael Saunders, Michael A. Maranas, Costas D. Lewis, Nathan E. Sauter, Thomas Palsson, Bernhard Ø. Thiele, Ines Fleming, Ronan M.T. Luxembourg Centre for Systems Biomedicine University of Luxembourg 6 avenue du Swing BelvauxL-4367 Luxembourg Life Sciences Research Unit University of Luxembourg 6 avenue du Swing BelvauxL-4367 Luxembourg University of Chile Blanco Encalada 2085 Santiago Chile Department of Pediatrics University of California San Diego School of Medicine San DiegoCA92093 United States Hinxton CambridgeCB10 1SD United Kingdom Department of Chemical Engineering Pennsylvania State University University University ParkPA16802 United States Department of Physics University of California San Diego 9500 Gilman Dr. San DiegoCA92093 United States Bioinformatics and Systems Biology Program University of California San Diego San DiegoCA United States Sinopia Biosciences San DiegoCA United States School of Computer Science Algorithms and Randomness Center Georgia Institute of Technology AtlantaGA United States Biomedical Engineering and Sciences Department TECNUN University of Navarra Paseo de Manuel Lardizabal 13 San Sebastian20018 Spain Institute of Microbiology and Biotechnology University of Latvia Jelgavas iela 1 RigaLV-1004 Latvia Department of Management Science and Engineering Stanford University StanfordCA94305-4026 United States Bioengineering Department University of California San Diego San DiegoCA United States Utah State University Research Foundation 1695 North Research Park Way North LoganUT84341 United States Centre for Integrative Systems Biology and Bioinformatics Department of Life Sciences Imperial College London London United Kingdom Department of Mathematics University of Alicante Spain California Institute of Technology Computing and Mathematical Sciences MC 305-16 1200 E. California Blvd. PasadenaCA91125 United States Mathomics Center for Mathematical Modeling University of Chile Beauchef 851 Santiago Chile Novo Nordisk Foundation Center for Biosustainability University of California San Diego San DiegoCA92093 Uni

COnstraint-Based Reconstruction and Analysis (COBRA) provides a molecular mechanistic framework for integrative analysis of experimental data and quantitative prediction of physicochemically and biochemically feasible phenotypic states. The COBRA Toolbox is a comprehensive software suite of interoperable COBRA methods. It has found widespread applications in biology, biomedicine, and biotechnology because its functions can be flexibly combined to implement tailored COBRA protocols for any biochemical network. Version 3.0 includes new methods for quality controlled reconstruction, modelling, topological analysis, strain and experimental design, network visualisation as well as network integration of chemoinformatic, metabolomic, transcriptomic, proteomic, and thermochemical data. New multi-lingual code integration also enables an expansion in COBRA application scope via high-precision, high-performance, and nonlinear numerical optimisation solvers for multi-scale, multi-cellular and reaction kinetic modelling, respectively. This protocol can be adapted for the generation and analysis of a constraint-based model in a wide variety of molecular systems biology scenarios. This protocol is an update to the COBRA Toolbox 1.0 and 2.0. The COBRA Toolbox 3.0 provides an unparalleled depth of constraint-based reconstruction and analysis methods. Copyright © 2017, The Authors. All rights reserved.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

Assembly independent functional annotation of short-read data using SOFA: Short-ORF functional annotation

Assembly independent functional annotation of short-read dat...

引用

IEEE Symposium on Computational Intelligence and bioinformatics and Computational Biology (CIBCB)

作者： Aria S. Hahn Niels W. Hanson Dongjae Kim Kishori M. Konwar Steven J. Hallam Department of Microbiology University of British Columbia Vancouver Canada Graduate Program in Bioinformatics University of British Columbia Vancouver Canada Department of Computer Science University of British Columbia Vancouver Canada

Accurate description of the microbial communities driving matter and energy transformations in complex ecosystems such as soils cannot yet be effectively accomplished using assembly-based approaches despite the rise of next generation sequencing technologies. Here we present SOFA, an open source pipeline enabling comparative functional annotation of unassembled short-read data. The pipeline attempts to merge mate pairs in fastq files, predicts open reading frames (ORFs) on merged and unmerged reads as small as 70 bps, and completes an additional step, we term `deduplication'. Deduplication prevents the double counting of ORFs predicted from unmerged paired-end reads by checking for homologous annotations that span the same ORF, allowing for quantitatively accurate predictions. The effectiveness of SOFA is validated with both simulated and bone fide soil metagenomes, and empirical results are compared to existing strategies for obtaining accurate ORF counts, and an analytical model of read duplication. SOFA enables downstream processing stages within the existing MetaPathways pipeline, and is available for download as a stand alone application at https://*** under the MIT license.

关键词： bioinformatics Pipelines Genomics Databases Soil Proteins Assembly

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：