PMC:1687185 / 3636-4146 JSONTXT

{"project":"2_test","denotations":[{"id":"17129371-8211139-1691517","span":{"begin":505,"end":506},"obj":"8211139"}],"text":"Although there are several variations of the motif finding algorithms, the problem discussed in this paper is defined as follows: without any previous knowledge of the consensus pattern, discover all the occurences of the motifs and then recover a pattern for which all of these instances are within a given number of mutations (or substitutions). Despite the significant amount of literature available on the motif finding problem, many do not exploit the probabilistic models used for motif refinement [5,6]."}