RESUMO
The pairwise comparison of RNA secondary structures is a fundamental problem, with direct application in mining databases for annotating putative noncoding RNA candidates in newly sequenced genomes. An increasing number of software tools are available for comparing RNA secondary structures, based on different models (such as ordered trees or forests, arc annotated sequences, and multilevel trees) and computational principles (edit distance, alignment). We describe here the website BRASERO that offers tools for evaluating such software tools on real and synthetic datasets.
RESUMO
SUMMARY: GenRGenS is a software tool dedicated to randomly generating genomic sequences and structures. It handles several classes of models useful for sequence analysis, such as Markov chains, hidden Markov models, weighted context-free grammars, regular expressions and PROSITE expressions. GenRGenS is the only program that can handle weighted context-free grammars, thus allowing the user to model and to generate structured objects (such as RNA secondary structures) of any given desired size. GenRGenS also allows the user to combine several of these different models at the same time.
Assuntos
Biologia Computacional/métodos , Genoma , Software , Simulação por Computador , Cadeias de Markov , Modelos Estatísticos , Conformação de Ácido Nucleico , Fases de Leitura Aberta , Linguagens de Programação , RNA/químicaRESUMO
Pairwise sequence alignments aim to decide whether two sequences are related and, if so, to exhibit their related domains. Recent works have pointed out that a significant number of true homologous sequences are missed when using classical comparison algorithms. This is the case when two homologous sequences share several little blocks of homology, too small to lead to a significant score. On the other hand, classical alignment algorithms, when detecting homologies, may fail to recognize all the significant biological signals. The aim of the paper is to give a solution to these two problems. We propose a new scoring method which tends to increase the score of an alignment when "blocks" are detected. This so-called Block-Scoring algorithm, which makes use of dynamic programming, is worth being used as a complementary tool to classical exact alignments methods. We validate our approach by applying it on a large set of biological data. Finally, we give a limit theorem for the score statistics of the algorithm.
Assuntos
Algoritmos , Biologia Computacional/métodos , RNA/química , Alinhamento de Sequência , Homologia de Sequência do Ácido Nucleico , Sequência de Bases , Simulação por Computador , Dados de Sequência MolecularRESUMO
We specifically sought genes within the yeast genome controlled by a non-conventional translation mechanism involving the stop codon. For this reason, we designed a computer program using the yeast database genomic regions, and seeking two adjacent open reading frames separated only by a unique stop codon (called SORFs). Among the 58 SORFs identified, eight displayed a stop codon bypass level ranging from 3 to 25%. For each of the eight sequences, we demonstrated the presence of a poly(A) mRNA. Using isogenic [PSI(+)] and [psi(-)] yeast strains, we showed that for two of the sequences the mechanism used is a bona fide readthrough. However, the six remaining sequences were not sensitive to the PSI state, indicating either a translation termination process independent of eRF3 or a new stop codon bypass mechanism. Our results demonstrate that the presence of a stop codon in a large ORF may not always correspond to a sequencing error, or a pseudogene, but can be a recoding signal in a functional gene. This emphasizes that genome annotation should take into account the fact that recoding signals could be more frequently used than previously expected.
Assuntos
Códon de Terminação/genética , Genes Fúngicos/genética , Saccharomyces cerevisiae/genética , Software , Sequência de Bases , Óperon Lac/genética , Luciferases/genética , Luciferases/metabolismo , Fases de Leitura Aberta/genética , Plasmídeos/genética , Biossíntese de Proteínas , RNA Mensageiro/genética , RNA Mensageiro/metabolismo , Proteínas Recombinantes de Fusão/genética , Proteínas Recombinantes de Fusão/metabolismo , Homologia de Sequência do Ácido Nucleico , beta-Galactosidase/genética , beta-Galactosidase/metabolismoRESUMO
MOTIVATION: Unconventional decoding events are now well acknowledged, but not yet well formalized. In this study, we present a bioinformatics analysis of eukaryotic -1 frameshifting, in order to model this event. RESULTS: A consensus model has already been established for -1 frameshifting sites. Our purpose here is to provide new constraints which make the model more precise. We show how a machine learning approach can be used to refine the current model. We identify new properties that may be involved in frameshifting. Each of the properties found was experimentally validated. Initially, we identify features of the overall model that are to be simultaneously satisfied. We then focus on the following two components: the spacer and the slippery sequence. As a main result, we point out that the identity of the primary structure of the so-called spacer is of great importance. AVAILABILITY: Sequences of the oligonucleotides in the functional tests are available at http://www.igmors.u-psud.fr/rousset/bioinformatics/.
