DatabasePub Date : 2022-03-09DOI: 10.1093/database/baac003
Nan Deng, Canglin Wu, A. Yaseen, Hulin Wu
{"title":"ImmuneData: an integrated data discovery system for immunology data repositories","authors":"Nan Deng, Canglin Wu, A. Yaseen, Hulin Wu","doi":"10.1093/database/baac003","DOIUrl":"https://doi.org/10.1093/database/baac003","url":null,"abstract":"To meet the increasing demand for data sharing, data reuse and meta-analysis in the immunology research community, we have developed the data discovery system ImmuneData. The system provides integrated access to five immunology data repositories funded by the National Institute of Allergy and Infectious Diseases, Division of Allergy, Immunology and Transplantation, including ImmPort, ImmuneSpace, ITN TrialShare, ImmGen and IEDB. ImmuneData restructures the data repositories' metadata into a uniform schema using domain experts' knowledge and state-of-the-art Natural Language Processing (NLP) technologies. It comes with a user-friendly web interface, accessible at http://www.immunedata.org/, and a Google-like search engine for biological researchers to find and access data easily. The vast quantity of synonyms used in biomedical research increase the likelihood of incomplete search results. Thus, our search engine converts queries submitted by users into ontology terms, which are then expended by NLP technologies to ensure that the search results will include all synonyms for a particular concept. The system also includes an advanced search function to build customized queries to meet higher-level users' needs. ImmuneData ensures the FAIR principle (Findability, Accessibility, Interoperability and Reusability) of the five data repositories to benefit data reuse in the immunology research community. The data pipeline constructing our system can be extended to other data repositories to build a more comprehensive biological data discovery system.\u0000\u0000\u0000DATABASE URL\u0000http://www.immunedata.org/.","PeriodicalId":81074,"journal":{"name":"Database","volume":"2022 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61078046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2022-03-01DOI: 10.1093/database/baac006
Beverly A. Underwood, L. Yankie, Eric P. Nawrocki, Vasuki Palanigobu, Sergiy Gotvyanskyy, V. C. Calhoun, Michael Kornbluh, Thomas G. Smith, Lydia Fleischmann, D. Sinyakov, Colleen J. Bollin, I. Karsch-Mizrachi
{"title":"Rapid automated validation, annotation and publication of SARS-CoV-2 sequences to GenBank","authors":"Beverly A. Underwood, L. Yankie, Eric P. Nawrocki, Vasuki Palanigobu, Sergiy Gotvyanskyy, V. C. Calhoun, Michael Kornbluh, Thomas G. Smith, Lydia Fleischmann, D. Sinyakov, Colleen J. Bollin, I. Karsch-Mizrachi","doi":"10.1093/database/baac006","DOIUrl":"https://doi.org/10.1093/database/baac006","url":null,"abstract":"Rapid response to the current coronavirus disease 2019 (COVID-19) pandemic requires fast dissemination of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) genomic sequence data in order to align diagnostic tests and vaccines with the natural evolution of the virus as it spreads through the world. To facilitate this, the National Library of Medicine's National Center for Biotechnology Information developed an automated pipeline for the deposition and quick processing of SARS-CoV-2 genome assemblies into GenBank for the user community. The pipeline ensures the collection of contextual information about the virus source, assesses sequence quality and annotates descriptive biological features, such as protein-coding regions and mature peptides. The process promotes standardized nomenclature and creates and publishes fully processed GenBank files within minutes of deposition. The software has processed and published 982 454 annotated SARS-CoV-2 sequences, as of 21 October 2021. This development addresses the needs of the scientific community as the sequencing of SARS-CoV-2 genomes increases and will facilitate unrestricted access to and usability of SARS-CoV-2 genomic sequence data, providing important reagents for scientific and public health activities in response to the COVID-19 pandemic. Database URL https://submit.ncbi.nlm.nih.gov/sarscov2/genbank/.","PeriodicalId":81074,"journal":{"name":"Database","volume":"2022 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61078549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2014-12-19DOI: 10.14257/ASTL.2014.65.14
S. Jang
{"title":"Design of a Software Tool for Privacy-Preserving Data Publishing","authors":"S. Jang","doi":"10.14257/ASTL.2014.65.14","DOIUrl":"https://doi.org/10.14257/ASTL.2014.65.14","url":null,"abstract":"To date, many software tools have been developed in order to help users to privately publish data. However, those tools are not easy for them to use because most data publishers do not have enough background knowledge. This paper describes a design of software system for privacy-preserving data publishing. The basic idea behind our approach is that preliminary actions are taken for data publishing in the early stage of the database design.","PeriodicalId":81074,"journal":{"name":"Database","volume":"1 1","pages":"57-60"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66977640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2014-12-19DOI: 10.14257/ASTL.2014.65.12
Hyun-Ho Lee, H. Park, Jin-Chul Park, K. Joo
{"title":"Extended Approach for the 2-Phase Query Evaluation (2PE) Scheme","authors":"Hyun-Ho Lee, H. Park, Jin-Chul Park, K. Joo","doi":"10.14257/ASTL.2014.65.12","DOIUrl":"https://doi.org/10.14257/ASTL.2014.65.12","url":null,"abstract":"Based on the previously proposed 2PE scheme, this paper proposes a new scheme called a 2-Phase Multiple Query Evaluation (2PME). The proposed scheme extends the 2PE scheme in a way that enables multiple multi- way join continuous queries to be more efficiently processed. It constructs a global execution plan that clusters a common sub-query walk (SQW) shared by more than two queries. Each cluster is executed only one time instead of being executed repeatedly for every related query. Ongoing changes in the rapid data streams in a data stream management system (DSMS) may be monitored using a number of pre-registered queries that report results continuously as new data elements of the data streams arrive (1,2). These queries are called continuous queries. In a previous study, we proposed a 2-phase query evaluation (2PE) scheme for a single multi-way join continuous query. Given a continuous query over multiple data streams, a preprocessing phase detects whether newly arrived stream tuples satisfy the query by identifying the maximum number of candidate tuples that could satisfy it. Subsequently, a evaluation phase identifies the stream tuples that satisfy the query among the candidate tuples specified in the previous phase. In this paper, the proposed 2PE scheme is extended as a way to process multiple continuous queries. It is called a 2-phase multiple query evaluation (2PME) scheme. Given a multi-way join continuous query, the 2PE scheme has defined a query walk, which is a specific order in which all the join predicates of the query are processed. The main issue of the 2PME scheme is how to efficiently share the common sub-query walks among the multiple multi-way join continuous queries, based on the matrix-based approach of 2PE. The proposed scheme shares common sub-query walks by constructing a global execution plan where the sub-query walks that are applicable to more than two continuous queries are clustered. Each cluster is","PeriodicalId":81074,"journal":{"name":"Database","volume":"1 1","pages":"49-53"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66977950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2014-12-19DOI: 10.14257/ASTL.2014.65.13
H. Byeon, Rae-ho Lee
{"title":"Analysis of Smoking in Korean Adolescents Based on Data Mining Techniques","authors":"H. Byeon, Rae-ho Lee","doi":"10.14257/ASTL.2014.65.13","DOIUrl":"https://doi.org/10.14257/ASTL.2014.65.13","url":null,"abstract":"The purpose of this study was to analyze the risk factors of adolescent smoking using data mining techniques. Data were from the 2012 Korea Youth Risk Behavior Web-based Survey. Subjects were 36,889 high school students (18,938 men, 17,951 women). A prediction model was developed by the use of a Classification and Regression Tree Algorithm. In the decision tree analysis, academic performance, suicidal ideation, type of school they attend and indirect smoking experience were significantly associated with adolescent smoking.","PeriodicalId":81074,"journal":{"name":"Database","volume":"6 1","pages":"54-56"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66978077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2014-12-19DOI: 10.14257/ASTL.2014.65.09
Jae-Hyun Seo, Eun-Sol Ko, Yong-Hyuk Kim
{"title":"Performance Comparison of GPUs with a Genetic Algorithm based on CUDA","authors":"Jae-Hyun Seo, Eun-Sol Ko, Yong-Hyuk Kim","doi":"10.14257/ASTL.2014.65.09","DOIUrl":"https://doi.org/10.14257/ASTL.2014.65.09","url":null,"abstract":"Generally genetic algorithm (GA) has disadvantage of taking a lot of computation time, and it is worth reducing the execution time while keeping good quality and result. Comparative experiments are conducted with one CPU and four GPUs using CUDA (Compute Unified Device Architecture) and generational GA. We implement the fitness functions of the GA which are suitable for the each environment of the CPU and the GPUs for performance comparison. When experimenting with the CPU, we handle the individual one by one. On the other hand, when experimenting with the GPU, we handle all individuals concurrently. And then we compare and analyze each result of our GA and each time required to process fitness function. There was not a huge difference between the results of the CPU experiment and the GPU ones. In the case of the analysis of computation time, the memory bandwidth of the GPU affects the computation time of fitness evaluation. The numbers of genes that can be processed at the same time are increased by the growth of the clock rate and the number of cores of GPU.","PeriodicalId":81074,"journal":{"name":"Database","volume":"1 1","pages":"36-40"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66977807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DatabasePub Date : 2014-12-19DOI: 10.14257/ASTL.2014.65.10
Jung-Gil Cho, Won-Whoi Huh
{"title":"Word Sense Disambiguation Using Tree-based Association Rule","authors":"Jung-Gil Cho, Won-Whoi Huh","doi":"10.14257/ASTL.2014.65.10","DOIUrl":"https://doi.org/10.14257/ASTL.2014.65.10","url":null,"abstract":"Word Sense Disambiguation is a part of natural language processing (NLP) and it is used to distinguish word sense in a context. This paper suggests a new method of Word Sense Disambiguation related to mining association rules. In this method, various word senses existing in WordNet are used to mine the association rules between ambiguous word sense and context.","PeriodicalId":81074,"journal":{"name":"Database","volume":"1 1","pages":"41-44"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66977865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}