The Altair Community is migrating to a new platform to provide a better experience for you. In preparation for the migration, the Altair Community is on read-only mode from October 28 - November 6, 2024. Technical support via cases will continue to work as is. For any urgent requests from Students/Faculty members, please submit the form linked here

compare the similarity of 100 DNA strings with string matching algorithms

abroonabroon Member Posts: 8 Contributor II
edited December 2018 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

  • MartinLiebigMartinLiebig Administrator, Moderator, Employee-RapidMiner, RapidMiner Certified Analyst, RapidMiner Certified Expert, University Professor Posts: 3,533 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

    - Sr. Director Data Solutions, Altair RapidMiner -
    Dortmund, Germany
Sign In or Register to comment.