Hi Adam, no, but after skimming the paper it doesn't look that complicated to implement. There is also a bunch of related work on how to reduce the work involved in global MSA, i.e. on bounding the maximal deviation from the main diagonal...
depends on what you want to actually do with the implementation. Viele Gruesse, Christian * Adam Sjøgren <a...@koldfront.dk> [01.10.2015 21:22]: > Hi, > > > Has anyone had a go at implementing the FOGSAA¹ algorithm in Haskell? > > > Best regards, > > Adam > > > ¹ http://www.nature.com/articles/srep01746 > > -- > "Scare yourself up against the wall" Adam Sjøgren > a...@koldfront.dk
