Cargando…

IntaRNA: efficient prediction of bacterial sRNA targets incorporating target site accessibility and seed regions

Motivation: During the last few years, several new small regulatory RNAs (sRNAs) have been discovered in bacteria. Most of them act as post-transcriptional regulators by base pairing to a target mRNA, causing translational repression or activation, or mRNA degradation. Numerous sRNAs have already be...

Descripción completa

Detalles Bibliográficos
Autores principales: Busch, Anke, Richter, Andreas S., Backofen, Rolf
Formato: Texto
Lenguaje:English
Publicado: Oxford University Press 2008
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2639303/
https://www.ncbi.nlm.nih.gov/pubmed/18940824
http://dx.doi.org/10.1093/bioinformatics/btn544
Descripción
Sumario:Motivation: During the last few years, several new small regulatory RNAs (sRNAs) have been discovered in bacteria. Most of them act as post-transcriptional regulators by base pairing to a target mRNA, causing translational repression or activation, or mRNA degradation. Numerous sRNAs have already been identified, but the number of experimentally verified targets is considerably lower. Consequently, computational target prediction is in great demand. Many existing target prediction programs neglect the accessibility of target sites and the existence of a seed, while other approaches are either specialized to certain types of RNAs or too slow for genome-wide searches. Results: We introduce INTARNA, a new general and fast approach to the prediction of RNA–RNA interactions incorporating accessibility of target sites as well as the existence of a user-definable seed. We successfully applied INTARNA to the prediction of bacterial sRNA targets and determined the exact locations of the interactions with a higher accuracy than competing programs. Availability: http://www.bioinf.uni-freiburg.de/Software/ Contact: IntaRNA@informatik.uni-freiburg.de Supplementary information: Supplementary data are available at Bioinformatics online.