Purpose: The purpose of this randomized blinded placebo-controlled research study was to investigate the effect of acupressure over 24 hours postoperatively for ambulatory surgical patients who are identified as high risk for PONV.
Design: A randomized blinded placebo-controlled study design was implemented.
Methods: Study enrollment criteria included four of five risk factors as defined in 2006 by American Society of PeriAnesthesia Nurses PONV/postdischarge nausea and vomiting guidelines: female, PONV history or motion sickness, nonsmoker, and volatile gas general anesthetic.
Background: Datasets generated on deep-sequencing platforms have been deposited in various public repositories such as the Gene Expression Omnibus (GEO), Sequence Read Archive (SRA) hosted by the NCBI, or the DNA Data Bank of Japan (ddbj). Despite being rich data sources, they have not been used much due to the difficulty in locating and analyzing datasets of interest.
Results: Geoseq http://geoseq.
Motivation: Profile hidden Markov models (pHMMs) are currently the most popular modeling concept for protein families. They provide sensitive family descriptors, and sequence database searching with pHMMs has become a standard task in today's genome annotation pipelines. On the downside, searching with pHMMs is computationally expensive.
View Article and Find Full Text PDFWe introduce the tool mkESA, an open source program for constructing enhanced suffix arrays (ESAs), striving for low memory consumption, yet high practical speed. mkESA is a user-friendly program written in portable C99, based on a parallelized version of the Deep-Shallow suffix array construction algorithm, which is known for its high speed and small memory usage. The tool handles large FASTA files with multiple sequences, and computes suffix arrays and various additional tables, such as the LCP table (longest common prefix) or the inverse suffix array, from given sequence data.
View Article and Find Full Text PDFBackground: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences. Searching with PSSMs in complete genomes or large sequence databases is a common, but computationally expensive task.
Results: We present a new non-heuristic algorithm, called ESAsearch, to efficiently find matches of PSSMs in large databases.