Digital Commons Network^™

Reoptimization Of The Consensus Pattern Problem Under Pattern Length Modification, Jhoirene B. Clemente, Proceso L. Fernandez Jr, Richelle Ann B. Juayong, Jasmine A. Malinao, Ivy Ordanel, Henry N. Adorna

Department of Information Systems & Computer Science Faculty Publications

In Bioinformatics, finding conserved regions in genomic sequences remains to be a challenge not just because of the increasing size of genomic data collected but because of the hardness of the combinatorial model of the problem. One problem formulation is called the Consensus Pattern Problem (CPP). Given a set of t n-length strings S = {S₁,..., S_t} defined over some constant size alphabet Σ and an integer l, where l ≤ n, the objective of CPP is to find an l-length string v and a set of l-length substrings si of each Si in S such …