Abstract
Position Weight Matrices are broadly used probabilistic motif models. In this paper, we address the problem of identifying and characterizing potential overlaps between occurrences of such a motif. It has useful applications to the statistics of the number of occurrences, and to weighted pattern matching with an extension of the well-known Knuth-Morris-Pratt algorithm.
This is a preview of subscription content, log in via an institution to check access.
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
Mount, S.: A catalogue of splice junction sequences. Nucleic Acids Research 10, 459–472 (1982)
Hulo, N., Sigrist, C., Saux, V.L., Langendijk-Genevaux, P., Bordoli, L., Gattiker, A., Castro, E.D., Bucher, P., Bairoch, A.: Recent improvements to the PROSITE database. Nucleic Acids Research 32, 134 (2004)
Ewens, W., Grant, G.: Statistical Methods in Bioinformatics. Springer, Heidelberg (2005)
Pape, U., Rahmann, S., Sun, F., Vingron, M.: Compound poisson approximation of the number of occurrences of a position frequency matrix (PFM) on both strands. Journal of Computation Biology 15, 547–564 (2008)
Knuth, D., Morris Jr., J., Pratt, V.: Fast pattern matching in strings. SIAM Journal on Computing (1977)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20, 762–772 (1977)
Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM (1975)
Sandelin, A., Alkema, W., Engström, P., Wasserman, W.: Jaspar: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research (2004)
Wu, T.D., Nevill-Manning, C.G., Brutlag, D.L.: Fast probabilistic analysis of sequence function using scoring matrices. Bioinformatics 16, 233–244 (2000)
Staden, R.: Methods for calculating the probabilities of finding patterns in sequences. Comput. Appl. Biosci. 5, 89–96 (1989)
Touzet, H., Varré, J.S.: Efficient and accurate p-value computation for position weight matrices. Algorithms for Molecular Biology 2 (2007)
Liefooghe, A., Touzet, H., Varré, J.S.: Large scale matching for position weight matrices. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 401–412. Springer, Heidelberg (2006)
Beckstette, M., Homann, R., Giegerich, R., Kurtz, S.: Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics (2006)
Pizzi, C., Rastas, P., Ukkonen, E.: Fast search algorithms for position specific scoring matrices. In: Hochreiter, S., Wagner, R. (eds.) BIRD 2007. LNCS (LNBI), vol. 4414, pp. 239–250. Springer, Heidelberg (2007)
Salmela, L., Tarhio, J.: Algorithms for weighted matching. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 276–286. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liefooghe, A., Touzet, H., Varré, JS. (2009). Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)