Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: (Golf) Fragment Reassembly

by indigo (Scribe)
on May 03, 2001 at 04:13 UTC ( #77535=note: print w/ replies, xml ) Need Help??

in reply to (Golf) Fragment Reassembly

92, although I suspect it may not run in polynomial time...:)

sub assemble {$l=eval(join'+',map{y===c}@_);for$x('a'..'z'x$l,'A'..'Z'x$l){return$x + if!grep{$x!~/$_/}@_}}

Comment on Re: (Golf) Fragment Reassembly
Download Code
Replies are listed 'Best First'.
Re: Re: (Golf) Fragment Reassembly
by dws (Chancellor) on May 03, 2001 at 04:43 UTC
    When I try to invoke this via   print assemble qw(GATTACA ATTACA GATT AAGAT CCC);
    I get   Modification of a read-only value attempted at line 2.
    If I pass a copy of the array, Perl runs out of memory (PIII-600, 256Mb, ActiveState Perl 5.6.0).

    The map looks suspicious.

      I'd strongly recommend not running this one with strings of length greater than 2...:)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://77535]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (3)
As of 2015-10-07 06:55 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (172 votes), past polls