in reply to Determine group membership for partial sequences

GrandFather,
I have been eyeing your node since you posted it. It seems to me that it is unlikely that there is anything you could do to your code to make it more meaningful to the audience. Even if they were non-perl programmers, the following would require a fair amount of explanation:
my @next = grep $_, split;

I think you would be better off by providing a plain english explanation of the algorithm. That way they can understand and agree with your approach even if they don't understand the code. I am not talking about comments nor even documentation. I think a completely distinct written explanation would be of the most benefit to this audience.

Cheers - L~R

Replies are listed 'Best First'.
Re^2: Determine group membership for partial sequences
by GrandFather (Saint) on Aug 23, 2007 at 18:42 UTC

    I agree. I suspect however that the primary author of the paper will tell me that it suffices that the code is available and anyone who is interested has all the information they need to "perform the experiment" themselves. Which is right in line with the laziness virtue. ;)


    DWIM is Perl's answer to Gödel
      GrandFather,
      I'm sorry, I meant to include a line that says "For more information, see <link>" because I agree that the explanation of the algorithm should take a back seat in the article. Trouble of posting at PerlMonks when you are supposed to be working.

      Cheers - L~R