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>
From	Vincent Davis <vincent@vincentdavis.net>
Date	2014-01-23 11:20 -0600
Subject	Re: generate De Bruijn sequence memory and string vs lists
Newsgroups	comp.lang.python
Message-ID	<mailman.5900.1390497690.18130.python-list@python.org> (permalink)

Show all headers | View raw

[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

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

Thread

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

csiph-web