in reply to Re^3: genetic algorithm for motif finding
in thread genetic algorithm for motif finding
Does this help a bit?
Some. Though it is still couched in a lot of terms that aren't immediately descriptive to the layman.
Is this close to a paraphrase of the problem?
A motif is a subsequence, of initially unknown length, that repeats, with minor variations, several times within a localised region of a (gene) sequence.
The problem of finding them is that of recognising that there are several near repetitions of a subsequence within a (relatively) short stretch (100s or low thousands) of 'letters'.
If that is close, then a few questions arise:
Or are the encoded in that other form where 1 letter is used to specif: this position might be any of 'a' or 'c'; or this position might be any of 'a' or 'g' or 't'?
Maybe I've nothing to contribute to the problem; but I was playing with a novel indexing algorithm a couple of years that might lend itself to this problem. My problem is getting a clear understanding of the problem in terms I can relate to without having to go off and become conversant in the genomic terminology.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^5: genetic algorithm for motif finding
by bioinformatics (Friar) on Aug 14, 2013 at 02:25 UTC | |
by BrowserUk (Patriarch) on Aug 14, 2013 at 09:34 UTC |