BACKGROUND: QStrain is an integrated resource platform designed to facilitate viral genome analysis and the rational design of nucleic acid therapeutics. RESULTS: The system integrates reference-guided multiple sequence alignment of high-risk viral pathogens, including Severe Acute Respiratory Syndrome Coronavirus 2, Lassa virus, Severe Fever with Thrombocytopenia Syndrome virus, Middle East Respiratory Syndrome Coronavirus, Influenza A virus subtype H5N1 and H7N9, Nipah virus, Respiratory Syncytial Virus, and Dengue virus, with a growing database of viral genomes. QStrain provides versatile visualization modules such as frequency profiles, conservation scores, RNA expression patterns, and phylogenetic trees to enhance the interpretation of viral sequence variation. By identifying highly conserved genomic regions, QStrain supports the prediction of candidate therapeutic targets and enables the automated design of small interfering RNA (siRNA) and antisense oligonucleotides (ASOs). Additional features include off-target searching and 2D structure viewing for comprehensive assessment of therapeutic potential. CONCLUSIONS: Ultimately, QStrain ( https://qstrain.sookmyung.ac.kr ) provides a critical, user-friendly framework to accelerate the design pipeline of nucleic acid-based therapies, enhancing preparedness against current and future viral outbreaks.

An investigation of parallel query processing issues in object-oriented databases is conducted. First the query model to be used is introduced. Three areas in which parallelism can be exploited in the query model are identified. The performance of each of the three areas is measured by mapping the query model to a parallel architecture and using analytic comparisons with the case in which query processing is performed on a single processor. The results show that parallel processing of a query is always somewhat faster than single-processor processing.>

Cyclic query processing issues in object-oriented databases are investigated. A data and cyclic query model is defined for an object-oriented database system, using a graph model. Then the efficient processing of a general object-oriented cyclic query is discussed. For efficient processing, a general cyclic query and the access plans generated for a given query are defined and a cost model is developed to determine the cost for each access plant generated. The retrieval algorithms used for actual data retrieval are also investigated.>

A query under an object-oriented data model exhibits characteristics which one finds in a relational query and those which clearly separate it from a relational query. The differences in turn have interesting impacts on the complexity of and strategy for query evaluation in object-oriented databases. The authors develop a model of a query under an object-oriented data model, and analyze the fundamental differences in the semantics of queries in object-oriented databases and relational databases.>