ANNOUNCEMENT: WE ARE PROUD TO ANNOUNCE THE LAUNCH OF THE NEW
RAPIDMINER ACADEMY
IT HAS ALL THE SAME TRAINING CONTENT AS HERE PLUS MUCH MORE.
ENJOY AND HAPPY RAPIDMINING!
@sgenzer, Community Manager

compare the similarity of 100 DNA strings with string matching algorithms

abroonabroon Member Posts: 8 Contributor I
edited December 1 in Help

My goal is to compare the similarity of 100 DNA strings with string matching algorithms, such as the Smith Waterman algorithm. In the RapidMiner, there is only the Levenshtein Distance algorithm. Help me out which operators to compare 100 strings together and then put the results as confusion in the matrix?

Tagged:

Answers

  • mschmitzmschmitz Moderator, Employee, RapidMiner Certified Analyst, RapidMiner Certified Expert Posts: 1,838  RM Data Scientist

    Hi @abroon,

    i think so far we only got Levenshtein for string distance. If you strings are of equal size you could use Split + Cross Distance to do some other metrics.

     

    Which String-Distances would you like to get in?

     

    BR,

    Martin

    - Head of Data Science Services at RapidMiner -
    Dortmund, Germany
Sign In or Register to comment.