Coding Challenges at Dconf2018: Implement Needleman–Wunsch and Smith–Waterman algorithms

[biocyberman]

Hellow D community.

I am attending Dconf 2018 and giving a talk there on May 4. Link: 
https://dconf.org/2018/talks/le.html. It will be very interesting 
to talk about the outcome of the following challenges. If we 
can't have at least 3 solutions by three individuals by 10:00 
GMT+2 May 4, I will have to postpone the deadline one week. 
Please see below for more details.


Implement Needleman–Wunsch and Smith–Waterman algorithm
══════════════════════════════
   • Introduction about alignment problems: 
[http://bit.do/seqalign] (notes) and
     [http://bit.do/alignslides] (slides) or search on wikipedia.
   • Send zipped source code of the solution via email to 
"biocyberman at gmail dot com" with "DAC2018" in the subject line.
   • Implement in D.
   • Output in [MSA] (global alignment) or BAM (local alignments)
   • Wining criteria: Combination of readability, reusability,
     scalability and speed
   • License: GPLv3. I will publish the solutions on Github.
   • Prize: USD100+ (more if others also want to sponsor?) for 
each problem (global or local aligment), sent via Papal or 
directly if we meet at Dconf2018.
   • Deadline: At least 3 solutions until 10:00 GMT+2 May 4, or 
24:00 GMT+2, Saturday 12 May 2018


[MSA] https://en.wikipedia.org/wiki/Multiple_sequence_alignment