Pattern Matching and Consensus Problems on Weighted Sequences and Profiles

Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski

Research output: Chapter in Book/Report/Conference proceedingOther chapter contributionpeer-review

10 Citations (Scopus)
134 Downloads (Pure)


We study pattern matching problems on two major representations of uncertain sequences used in molecular biology: weighted sequences (also known as position weight matrices, PWM) and profiles (i.e., scoring matrices). In the simple version, in which only the pattern or only the text is uncertain, we obtain efficient algorithms with theoretically-provable running times using a variation of the lookahead scoring technique. We also consider a general variant of the pattern matching problems in which both the pattern and the text are uncertain. Central to our solution is a special case where the sequences have equal length, called the consensus problem. We propose algorithms for the consensus problem parameterized by the number of strings that match one of the sequences. As our basic approach, a careful adaptation of the classic meet-in-themiddle algorithm for the knapsack problem is used. On the lower bound side, we prove that our dependence on the parameter is optimal up to lower-order terms conditioned on the optimality of the original algorithm for the knapsack problem.
Original languageEnglish
Title of host publication27th International Symposium on Algorithms and Computation (ISAAC 2016)
EditorsSeok-Hee Hong
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
ISBN (Print)978-3-95977-026-2
Publication statusPublished - 2016

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik


Dive into the research topics of 'Pattern Matching and Consensus Problems on Weighted Sequences and Profiles'. Together they form a unique fingerprint.

Cite this