motif | Scala-like pattern matching for Java | Functional Programming library

I need help to finish my first little app. I'm trying to do action for checked's rows in a datagrid.

the xaml :

"Find Word Count"- Instructions: Given an input string (assume it's essentially a paragraph of text) and a word to find, return the number of times in the input string that the word is found. Should be case agnostic and remove space, commas, full stops, quotes, tabs etc while finding the matching word.

=======================

My code doesn't work properly.

I would like to loop through file1, which has two columns. Each column has a string that I would like to use to search in a dataframe file (file2) with 18 columns. I'd like to select rows from file2 that have both strings from file1 in two different columns to create a new file.

file1 (tab separated file with about 150 rows, it has no header)

Code/Program:

I am trying to get the unique values of a column from a tab. The values are repeated and the file has 1,000+ lines, I just want to have the names of the values, not all, and the ones that are repeated. I'm working on my code, but when I do "RUN" it generates the separate and random letters of the values (see example in 'Output' below). I hope someone can help me find my mistake. Please and thank you very much!

Code:

I am using a Motif Widget Scrolledlist. The list is created as follows:

I am trying to create an option menu using Motif toolkit.

If I try this, it works:

I’m working on a variation of the Motif Search Problem and have hit a block on the logic of one of the subparts.

The problem is:

You have the alphabet — ['A', 'C', 'G', 'T']

Now, you are given an array of strings made of these alphabets with length L and are given a hamming distance D.

For example, if we take L=3, d=2 and are given the array ["ACT","TGC","GTA"].

For each string in the array, we must generate strings of the same length (3 in this case) using the alphabet which have a hamming distance of d. The hamming distance d means that the final string will only have d edits (two if d = 2) as compared to the original string.

So if we take the example of ACT from the array, we must generate GTT, AAG, CGT and so on. And I want to store these generated strings in a list.

A recursive function that breaks down the string seems like the most efficient way to do it but I’m having trouble implementing it. Any ideas for the logic explained with code/pseudocode? I need to be able to extend this problem to L = 15 and d = 5.

Example of Hamming distance d = 1.

I am currently looking for TFBS motifs in DNA. The original code I wrote to look for 10 different transcription factor motifs worked beautifully. But now I want to search for more than 100 motifs. Therefore I want to use loops so that I dont have to type in all the motif names manually (and can easily change my list if my interests change). But when I do this my code no longer works. I can print the result of the loops and it looks like the list contains all the correct information, but when I then use this list to compare with my DNA the list seems to only remember the last item of the list.

Here is my original code that works: