|
|
| "be consistent" | |
| PerlMonks |
(dws)Re: (Golf) Fragment Reassemblyby dws (Chancellor) |
| on May 02, 2001 at 09:26 UTC ( #77244=note: print w/ replies, xml ) | Need Help?? |
|
For my first round of Golf at the Monastery, here's a non-strict, non-polynomial approach. emits AAGATTACACCC That's 248 by my count (less the extra newlines that I threw in to avoid ugly wrapping). There's a 20 character test that prunes the search space back, but not enough (I think) to make it a polynomial solution.
Update:
In Section
Meditations
|
|
||||||||||||||||||||||