Abstract
RNAi, short for RNA Interference, a phenomenon of inhibiting the expression of genes, is widely adopted in laboratories for the study of pathways and determination of gene function. Recent studies have shown that RNAi could be used as an approach to treat diseases like cancers and some genetic disorders in which the down-regulation of a protein could prevent or stop progression of the disease. In [7], the problem of detecting endogenous dsRNA control elements and their corresponding mRNA target, i.e., the gene under RNAi control by degradation, in complete genomes of species using a suffix tree data structure is discussed. While the algorithm identifies triple repeats in the genome sequence in linear time, its very high memory requirement (12 GB for the C. elegans genome of size 100 Mbp) becomes a bottleneck for processing genomes of higher order. In this paper, we give algorithms that are space and time efficient in practice than the suffix tree based algorithm. Our algorithms are based on simple array data structures and adopt basic sorting techniques to identify the desired patterns in a given genome sequence. We achieve a speedup of 23 and reduction in memory requirement by a factor of 12 for the C. elegans genome, over the suffix tree approach, making the processing of higher order genomes possible for detecting such endogenous controls and targets for RNAi by degradation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, N., et al.: RNA Interference: Biology, Mechanism, and Applications. Microbiology and Molecular Biology Reviews, 657–685 (2003)
Buhler, J., Tompa, M.: Finding motifs using random projections. In: Proc. Fifth Annual International Conference on Computational Molecular Biology (RECOMB) (2001)
Caplen, N.J., Mousses, S.: Short Interfering RNA (siRNA)-Mediated RNA Interference (RNAi) in Human Cells. Ann. N. Y. Acad. Sci. 1002, 56–62 (2003)
Chalk, A.M., Wahlestedt, C., Sonnhammer, E.L.L.: Improved and automated prediction of effective siRNA. Biochemical and Biophysical Research Communications 319, 264–274 (2004)
Fire, A., et al.: Potent and specific genetic interference by double-stranded RNA in Caenorhabditis elegans. Nature 391, 806–811 (1998)
Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)
Horesh, Y., et al.: A rapid method for detection of putative RNAi target genes in genomic data. Bioinformatics 19(2), ii73–ii80 (2003)
Lim, L.P., et al.: The microRNAs of Caenorhabditis elegans. Genes and Development 17, 991–1008 (2003)
Rajasekaran, S., et al.: High-performance Exact Algorithms for Motif Search. Journal of Clinical Monitoring and Computing 19(4-5), 319–328 (2005)
Rajasekaran, S., Balla, S., Huang, C.-H.: Exact Algorithms for Planted Motif Problems. Journal of Computational Biology 12(8), 1117–1128 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balla, S., Rajasekaran, S. (2007). Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. In: Măndoiu, I., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2007. Lecture Notes in Computer Science(), vol 4463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72031-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-72031-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72030-0
Online ISBN: 978-3-540-72031-7
eBook Packages: Computer ScienceComputer Science (R0)