Re: Wavelet "filter"?
- To: mathgroup at smc.vnet.net
- Subject: [mg84942] Re: Wavelet "filter"?
- From: Bill Rowe <readnewsciv at sbcglobal.net>
- Date: Sun, 20 Jan 2008 03:40:01 -0500 (EST)
On 1/19/08 at 6:06 AM, edsferr at uol.com.br (edsferr) wrote:
>Replying the questions:
>The 14 characters strings are all the possible strings with length
>14, i.e. 2^14=16384 strings.
>What I need is to select the ones which have higher probability to
>occur according to the wavelet power spectrum. Is it possible? I'ts
>like to see, if I'm not saying anything absurd, what are the most
>probable 14 length DNA sequence given a 4096 length sample. What
>happens in my case is that this sample is not randomically
>generated.
There really isn't much need to use wavelets to find the most
frequent 14 character long strings in your data set.
A simulated data set can be generated using:
data = RandomInteger[{0,1},4096];
All possible 14 character long strings in this longer set can be
computed using
Partition[data,14,1]
Since your data set is simply 1's and 0's, it is convenient to
encode them as a integer using FromDigits. So,
h = Split[Sort[FromDigits[#, 2] & /@ Partition[data, 14, 1]]];
will group all similar 14 character strings. And the most
frequent 5 will be
In[22]:= First /@ (h[[Ordering[h]]][[-5 ;;]])
Out[22]= {15466,16141,1859,6230,11307}
which can be converted back to 14 character strings if you like
using IntegerDigits[n,2,14] where n is the encoded string value.
--
To reply via email subtract one hundred and four