Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.python > #64623 > unrolled thread

Re: generate De Bruijn sequence memory and string vs lists

Started byVincent Davis <vincent@vincentdavis.net>
First post2014-01-23 11:20 -0600
Last post2014-01-23 11:20 -0600
Articles 1 — 1 participant

Back to article view | Back to comp.lang.python

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: generate De Bruijn sequence memory and string vs lists Vincent Davis <vincent@vincentdavis.net> - 2014-01-23 11:20 -0600

#64623 — Re: generate De Bruijn sequence memory and string vs lists

FromVincent Davis <vincent@vincentdavis.net>
Date2014-01-23 11:20 -0600
SubjectRe: generate De Bruijn sequence memory and string vs lists
Message-ID<mailman.5900.1390497690.18130.python-list@python.org>

[Multipart message — attachments visible in raw view] — view raw

On Thu, Jan 23, 2014 at 10:18 AM, Dave Angel <davea@davea.name> wrote:

> If memory size is your issue,  why not make the function a
>  generator,  by replacing the append with a yield?
>

​One more thought on the generator. I have an idea for how to use the
generator but I still need 1, chucks of size n de_brujin(k, n) and the
ordering the same ordering as found in ​de_brujin(k, n).
I am not really sure how to modify the algorithm to do that. Any ideas? I
won't have time to think hard about that until later.


Vincent Davis
720-301-3003

[toc] | [standalone]


Back to top | Article view | comp.lang.python


csiph-web