Re: generate De Bruijn sequence memory and string vs lists

Date	2014-01-25 18:11 +1300
From	Greg Ewing <greg.ewing@canterbury.ac.nz>
Subject	Re: generate De Bruijn sequence memory and string vs lists
References	<CALyJZZVU+j64Jn7fqqzLmwW+KcM=43UMKjo=HW7umnq8MSP2Uw@mail.gmail.com> <lbrf82$fb3$1@ger.gmane.org> <mailman.5903.1390500573.18130.python-list@python.org> <bkemj0F48q8U1@mid.individual.net> <CALyJZZVv_gwC40a5mXhnoxBM5+5+Z2y=t6Ar=x=ifPh+vZN8GQ@mail.gmail.com>
Newsgroups	comp.lang.python
Message-ID	<mailman.5963.1390626709.18130.python-list@python.org> (permalink)

Show all headers | View raw

Vincent Davis wrote:
> True, the "all you want is a mapping" is not quite true. I actually 
> plan to plot frequency (the number of times an observed sub sequence 
> overlaps a value in the De Bruijn sequence) The way the sub sequences 
> overlap is important to me and I don't see a way go from base-k (or any 
> other base) to the index location in the De Bruijn sequence. i.e. 
> a decoding algorithm.

So the order or position in which the subsequences appear
in the de Bruijn sequence is important?

Can you explain more about what you're trying to do? Maybe
give a scaled-down example?

Whatever it is, it seems like there should be a more
efficient way than materialising the whole umpteen-gigabyte
sequence.

-- 
Greg

Back to comp.lang.python | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Re: generate De Bruijn sequence memory and string vs lists Vincent Davis <vincent@vincentdavis.net> - 2014-01-23 11:10 -0600
  Re: generate De Bruijn sequence memory and string vs lists Gregory Ewing <greg.ewing@canterbury.ac.nz> - 2014-01-24 21:29 +1300
    Re: generate De Bruijn sequence memory and string vs lists Vincent Davis <vincent@vincentdavis.net> - 2014-01-24 07:20 -0600
    Re: generate De Bruijn sequence memory and string vs lists Greg Ewing <greg.ewing@canterbury.ac.nz> - 2014-01-25 18:11 +1300

csiph-web