Sequence embedding for fast construction of guide trees for multiple sequence alignment

Background  

The most widely used multiple sequence alignment methods require sequences to be clustered as an initial step. Most sequence clustering methods require a full distance matrix to be computed between all pairs of sequences. This requires memory and time proportional to N ² for N sequences. When N grows larger than 10,000 or so, this becomes increasingly prohibitive and can form a significant barrier to carrying out very large multiple alignments.     

Evaluation of sequence alignments and oligonucleotide probes with respect to three-dimensional structure of ribosomal RNA using ARB software package

Background  

Availability of high-resolution RNA crystal structures for the 30S and 50S ribosomal subunits and the subsequent validation of comparative secondary structure models have prompted the biologists to use three-dimensional structure of ribosomal RNA (rRNA) for evaluating sequence alignments of rRNA genes. Furthermore, the secondary and tertiary structural features of rRNA are highly useful and successfully employed in designing rRNA targeted oligonucleotide probes intended for in situ hybridization experiments. RNA3D, a program to combine sequence alignment information with three-dimensional structure of rRNA was developed. Integration into ARB software package, which is used extensively by the scientific community for phylogenetic analysis and molecular probe designing, has substantially extended the functionality of ARB software suite with 3D environment.     

Mapping sequences by parts

Background:  

We present the N-map method, a pairwise and asymmetrical approach which allows us to compare sequences by taking into account evolutionary events that produce shuffled, reversed or repeated elements. Basically, the optimal N-map of a sequence s over a sequence t is the best way of partitioning the first sequence into N parts and placing them, possibly complementary reversed, over the second sequence in order to maximize the sum of their gapless alignment scores.     

An efficient method for the prediction of deleterious multiple-point mutations in the secondary structure of RNAs using suboptimal folding solutions

Background  

RNAmute is an interactive Java application which, given an RNA sequence, calculates the secondary structure of all single point mutations and organizes them into categories according to their similarity to the predicted structure of the wild type. The secondary structure predictions are performed using the Vienna RNA package. A more efficient implementation of RNAmute is needed, however, to extend from the case of single point mutations to the general case of multiple point mutations, which may often be desired for computational predictions alongside mutagenesis experiments. But analyzing multiple point mutations, a process that requires traversing all possible mutations, becomes highly expensive since the running time is O(n ^m ) for a sequence of length n with m-point mutations. Using Vienna's RNAsubopt, we present a method that selects only those mutations, based on stability considerations, which are likely to be conformational rearranging. The approach is best examined using the dot plot representation for RNA secondary structure.     

A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup

Background  

The problem of computationally predicting the secondary structure (or folding) of RNA molecules was first introduced more than thirty years ago and yet continues to be an area of active research and development. The basic RNA-folding problem of finding a maximum cardinality, non-crossing, matching of complimentary nucleotides in an RNA sequence of length n, has an O(n ³)-time dynamic programming solution that is widely applied. It is known that an o(n ³) worst-case time solution is possible, but the published and suggested methods are complex and have not been established to be practical. Significant practical improvements to the original dynamic programming method have been introduced, but they retain the O(n ³) worst-case time bound when n is the only problem-parameter used in the bound. Surprisingly, the most widely-used, general technique to achieve a worst-case (and often practical) speed up of dynamic programming, the Four-Russians technique, has not been previously applied to the RNA-folding problem. This is perhaps due to technical issues in adapting the technique to RNA-folding.     

Simple statistical models predict C-to-U edited sites in plant mitochondrial RNA

Background  

RNA editing is the process whereby an RNA sequence is modified from the sequence of the corresponding DNA template. In the mitochondria of land plants, some cytidines are converted to uridines before translation. Despite substantial study, the molecular biological mechanism by which C-to-U RNA editing proceeds remains relatively obscure, although several experimental studies have implicated a role for cis-recognition. A highly non-random distribution of nucleotides is observed in the immediate vicinity of edited sites (within 20 nucleotides 5' and 3'), but no precise consensus motif has been identified.     

RNAslider: a faster engine for consecutive windows folding and its application to the analysis of genomic folding asymmetry

Background  

Scanning large genomes with a sliding window in search of locally stable RNA structures is a well motivated problem in bioinformatics. Given a predefined window size L and an RNA sequence S of size N (L < N), the consecutive windows folding problem is to compute the minimal free energy (MFE) for the folding of each of the L-sized substrings of S. The consecutive windows folding problem can be naively solved in O(NL³) by applying any of the classical cubic-time RNA folding algorithms to each of the N-L windows of size L. Recently an O(NL²) solution for this problem has been described.     

On the Manner of Cyclization of <Emphasis Type="Italic">N</Emphasis>-Acylated Aspartic and Glutamic Acid Derivatives

Abstract  

When synthesizing arylpiperazine library modified with N-acylated amino acid derivatives (e.g., cyclized aspartic acid, cyclized glutamic acid, proline) we wished to rapidly determine the way of cyclization of N-acylated glutamic acid derivatives. During concomitant cleavage and cyclization two alternative routes were possible—either formation of six-member imide (glutarimide) or five-member lactam. Application of MS/MS and ¹H NMR method allowed us to establish that cyclization of N-acylated glutamic acid derivatives preceded to lactams—N-acylated pyroglutamic acid derivatives.     

Shape based indexing for faster search of RNA family databases

Background  

Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally annotated RNA families. Unfortunately, searching for new family members using covariance models (CMs) is very time consuming. Filtering approaches that use the sequence conservation to reduce the number of CM searches, are fast, but it is unknown to which sacrifice.     

A combined in vitro / in vivo selection for polymerases with novel promoter specificities

Background  

The DNA-dependent RNA polymerase from T7 bacteriophage (T7 RNAP) has been extensively characterized, and like other phage RNA polymerases it is highly specific for its promoter. A combined in vitro / in vivo selection method has been developed for the evolution of T7 RNA polymerases with altered promoter specificities. Large (10³ – 10⁶) polymerase libraries were made and cloned downstream of variant promoters. Those polymerase variants that can recognize variant promoters self-amplify both themselves and their attendent mRNAs in vivo. Following RT / PCR amplification in vitro, the most numerous polymerase genes are preferentially cloned and carried into subsequent rounds of selection.     

Production of <Emphasis Type="Italic">N</Emphasis><Superscript><Emphasis Type="Italic">α</Emphasis></Superscript>-acetylated thymosin α1 in <Emphasis Type="Italic">Escherichia coli</Emphasis>

Background  

Thymosin α1 (Tα1), a 28-amino acid N ^α -acetylated peptide, has a powerful general immunostimulating activity. Although biosynthesis is an attractive means of large-scale manufacture, to date, Tα1 can only be chemosynthesized because of two obstacles to its biosynthesis: the difficulties in expressing small peptides and obtaining N ^α -acetylation. In this study, we describe a novel production process for N ^α -acetylated Tα1 in Escherichia coli.     

Design,implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics

Background  

The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include arbitrary pseudoknots. For restricted classes of pseudoknots, several polynomial time algorithms have been designed, where the O(n ⁶)time and O(n ⁴) space algorithm by Rivas and Eddy is currently the best available program.     

Utilization of tmRNA sequences for bacterial identification

Background  

Ribosomal RNA molecules are widely used for phylogenetic and in situ identification of bacteria. Nevertheless, their use to distinguish microorganisms within a species is often restricted by the high degree of sequence conservation and limited probe accessibility to the target in fluorescence in situ hybridization (FISH). To overcome these limitations, we examined the use of tmRNA for in situ identification. In E. coli, this stable 363 nucleotides long RNA is encoded by the ssrA gene, which is involved in the degradation of truncated proteins.     

Relationship of SARS-CoV to other pathogenic RNA viruses explored by tetranucleotide usage profiling

Background  

The exact origin of the cause of the Severe Acute Respiratory Syndrome (SARS) is still an open question. The genomic sequence relationship of SARS-CoV with 30 different single-stranded RNA (ssRNA) viruses of various families was studied using two non-standard approaches. Both approaches began with the vectorial profiling of the tetra-nucleotide usage pattern V for each virus. In approach one, a distance measure of a vector V, based on correlation coefficient was devised to construct a relationship tree by the neighbor-joining algorithm. In approach two, a multivariate factor analysis was performed to derive the embedded tetra-nucleotide usage patterns. These patterns were subsequently used to classify the selected viruses.     

Identification of a novel anti-σ<Superscript>E</Superscript> factor in <Emphasis Type="Italic">Neisseria meningitidis</Emphasis>

Background  

Fine tuning expression of genes is a prerequisite for the strictly human pathogen Neisseria meningitidis to survive hostile growth conditions and establish disease. Many bacterial species respond to stress by using alternative σ factors which, in complex with RNA polymerase holoenzyme, recognize specific promoter determinants. σ^E, encoded by rpoE (NMB2144) in meningococci, is known to be essential in mounting responses to environmental challenges in many pathogens. Here we identified genes belonging to the σ^E regulon of meningococci.     

The Subviral RNA Database: a toolbox for viroids, the hepatitis delta virus and satellite RNAs research

Background  

Viroids, satellite RNAs, satellites viruses and the human hepatitis delta virus form the 'brotherhood' of the smallest known infectious RNA agents, known as the subviral RNAs. For most of these species, it is generally accepted that characteristics such as cell movement, replication, host specificity and pathogenicity are encoded in their RNA sequences and their resulting RNA structures. Although many sequences are indexed in publicly available databases, these sequence annotation databases do not provide the advanced searches and data manipulation capability for identifying and characterizing subviral RNA motifs.     

Pore forming polyalkylpyridinium salts from marine sponges versus synthetic lipofection systems: distinct tools for intracellular delivery of cDNA and siRNA

Background  

Haplosclerid marine sponges produce pore forming polyalkylpyridinium salts (poly-APS), which can be used to deliver macromolecules into cells. The aim of this study was to investigate the delivery of DNA, siRNA and lucifer yellow into cells mediated by poly-APS and its potential mechanisms as compared with other lipofection systems (lipofectamine and N ⁴,N ⁹-dioleoylspermine (LipoGen)). DNA condensation was evaluated and HEK 293 and HtTA HeLa cells were used to investigate pore formation and intracellular delivery of cDNA, siRNA and lucifer yellow.     

Evaluation of 3D-Jury on CASP7 models

Background  

3D-Jury, the structure prediction consensus method publicly available in the Meta Server , was evaluated using models gathered in the 7 ^th round of the Critical Assessment of Techniques for Protein Structure Prediction (CASP7). 3D-Jury is an automated expert process that generates protein structure meta-predictions from sets of models obtained from partner servers.