Advertisement

Motif Matching Using Gapped Patterns

  • Emanuele Giaquinta
  • Kimmo Fredriksson
  • Szymon Grabowski
  • Esko Ukkonen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8288)

Abstract

We consider the problem of matching a set \(\mathcal{P}\) of gapped patterns against a given text T of length n, where a gapped pattern is a sequence of strings (keywords), over a finite alphabet Σ of size σ, such that there is a gap of fixed length between each two consecutive strings.We assume the RAM model, with words of size w in bits.We are interested in computing the list ofmatching patterns for each position in the text. This problem is a specific instance of the Variable Length Gaps problem [2] (VLG problem) for multiple patterns and has applications in the discovery of transcription factor (TF) binding sites in DNA sequences when using generalized versions of the PositionWeightMatrix (PWM) model to representTF binding specificities. The paper [5] describes howa motif represented as a generalizedPWM can bematched as a set of gapped patternswith unit-length keywords, and presents algorithms for the restricted case of patterns with two unit-length keywords.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bille, P., Gørtz, I.L., Vildhøj, H.W., Wind, D.K.: String matching with variable length gaps. Theor. Comput. Sci. 443, 25–34 (2012)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Charikar, M. (ed.) SODA, pp. 1297–1308. SIAM (2010)Google Scholar
  4. 4.
    Giaquinta, E., Fredriksson, K., Grabowski, S., Tomescu, A.I., Ukkonen, E.: Motif matching using gapped patterns. CoRR abs/1306.2483 (2013)Google Scholar
  5. 5.
    Giaquinta, E., Grabowski, S., Ukkonen, E.: Fast matching of transcription factor motifs using generalized position weight matrix models. Journal of Computational Biology 20(9), 1–10 (2013)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Haapasalo, T., Silvasti, P., Sippu, S., Soisalon-Soininen, E.: Online dictionary matching with variable-length gaps. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 76–87. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Sippu, S., Soisalon-Soininen, E.: Online matching of multiple regular patterns with gaps and character classes. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 523–534. Springer, Heidelberg (2013)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Emanuele Giaquinta
    • 1
  • Kimmo Fredriksson
    • 2
  • Szymon Grabowski
    • 3
  • Esko Ukkonen
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland
  2. 2.School of ComputingUniversity of Eastern FinlandKuopioFinland
  3. 3.Institute of Applied Computer ScienceLodz University of TechnologyŁódźPoland

Personalised recommendations