Question: Approximate Sequence Matching Libraries For The Jvm?
gravatar for Gabriel Mitchell
8.3 years ago by
Gabriel Mitchell520 wrote:

I am currently working on some toy problems to teach myself about sequence alignment. I want to benchmark my efforts against the performance of existing libraries for the JVM (I am developing in Clojure right now). I have learned that org.apache.commons.lang.StringUtils implements Levenshtein distance between two string. However, I will eventually be interested in the problem where different mutations are weighted differently (i.e. insertion may have a higher penalty than substitutions). Can someone point me to a mature Java or Jython library that does this ? I am NOT talking about BLAST or other heuristic methods. For now I want to benchmark against exact methods.

alignment java sequence • 1.1k views
ADD COMMENTlink modified 6.7 years ago by Audriusa10 • written 8.3 years ago by Gabriel Mitchell520
gravatar for Pierre Lindenbaum
8.3 years ago by
France/Nantes/Institut du Thorax - INSERM UMR1087
Pierre Lindenbaum113k wrote:

I just found this one in my delicious bookmarks :

ADD COMMENTlink written 8.3 years ago by Pierre Lindenbaum113k

There it is! Thanks.

ADD REPLYlink written 8.3 years ago by Gabriel Mitchell520
gravatar for Audriusa
6.7 years ago by
Audriusa10 wrote:

Check Sequence_alignment at The source code under GPL is here. This project also contains several demo applets for various sequence algorithms, also with source code available.

ADD COMMENTlink modified 5 weeks ago by RamRS18k • written 6.7 years ago by Audriusa10
Please log in to add an answer.


Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 735 users visited in the last hour