I know about it, isn't there a simple C++ static binary?
Faster Needleman-Wunsch rapid global alignment of two sequences?
Hi all, A student of mine has been using stretcher from EMBOSS. Is there a faster program that ideally works easily with:
program input1.fa.gz input2.fa.gz
where we would have a multifasta as output and some stats?
Thank you in advance!
• 2,346 views
•
link
2 answers
If you are willing to do some coding I think https://github.com/smarco/WFA2-lib is among the fastest global aligners, the repo has C++ examples too
• 0 views
•
link
I have also recently come across another global alignment algorithm that was recently released which could seem pretty interesting to test out as well: APA & APA2: A* Pairwise Aligner.
• 0 views
•
link
We tested it, however, it does not seem to produce a fast a file of the results or anything that we can easily parse. It produces a CIGAR as far as we know.
• 0 views
•
link
Log in to answer this question.
I would have thought
needlefrom EMBOSS would be the option to use.needle is great! but it does not handle sequences of 100k or so.
Then you may want to see if a program like
lastz(LINK) may be useful.