Space Efficient Modifications to Structator— A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns

  • Benjamin Albrecht
  • Volker Heun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7276)

Abstract

This work deals with the program Structator — a fast index-based search tool for RNA sequence-structure patterns. We present two space efficient modifications which both outperform the existing methods when searching large databases. Thus, our new methods make the program accessible for a wider range of real-world applications.

Keywords

Binary Search Pattern Search Search Step Database Size Index Construction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithm 2, 53–86 (2004)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Beckstette, M., Homann, R., Giegerich, R., Kurtz, S.: Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics 7, 389 (2006)CrossRefGoogle Scholar
  3. 3.
    Fischer, J.: Combined Data Structure for Previous- and Next-Smaller-Values. Theor. Comput. Sci. 412(22), 2451–2456 (2011)MATHCrossRefGoogle Scholar
  4. 4.
    Fischer, J., Heun, V.: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40(2), 465–492 (2011)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Gardner, P.P., Wilm, A., Washietl, S.: A benchmark of multiple sequence alignment programs upon structural RNAs. Nucleic Acids Res. 33, 2433–2439 (2005)CrossRefGoogle Scholar
  6. 6.
    Gardner, P.P., Daub, J., Tate, J., Moore, B.L., Osuch, I.H., Griffiths-Jones, S., Finn, R.D., Nawrocki, E.P., Kolbe, D.L., Eddy, S.R., Bateman, A.: Rfam: Wikipedia, clans and the ”decimal” release. Nucleic Acids Res. 39, D141–D145 (2011)Google Scholar
  7. 7.
    Kärkkäinen, J., Sanders, P.: Simple Linear Work Suffix Array Construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Kim, D.-K., Sim, J.S., Park, H.-J., Park, K.: Linear-Time Construction of Suffix Arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186–199. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200–210. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Mattick, J.S.: RNA regulation: a new genetics? Nat. Rev. Genet. 5, 316–323 (2004)CrossRefGoogle Scholar
  12. 12.
    Mattick, J.S., Taft, R.J., Faulkner, G.J.: A global view of genomic information-moving beyond the gene and the master regulator. Trends Genet. 26, 21–28 (2010)CrossRefGoogle Scholar
  13. 13.
    Meyer, F., Kurtz, S., Backofen, R., Will, S., Beckstette, M.: Structator: fast index-based search for RNA sequence-structure patterns. BMC Bioinformatics 12, 214 (2011)CrossRefGoogle Scholar
  14. 14.
    Myers, U., Manber, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22, 935–948 (1993)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Strothmann, D.: The affix array data structure and its applications to RNA secondary structure analysis. Theor. Comput. Sci. 389(1-2), 278–294 (2007)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Benjamin Albrecht
    • 1
  • Volker Heun
    • 1
  1. 1.Institut für InformatikLudwig-Maximilians-UniversitätMünchenGermany

Personalised recommendations