Abstract
This paper addresses the problem of multiple pattern matching for motifs encoded by Position Weight Matrices. We first present an algorithm that uses a multi-index table to preprocess the set of motifs, allowing a dramatically decrease of computation time. We then show how to take benefit from simlar motifs to prevent useless computations. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Liefooghe, A., Touzet, H., & Varré, J. S. (2006). Large scale matching for position weight matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4009 LNCS, pp. 401–412). Springer Verlag. https://doi.org/10.1007/11780441_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
