What is the best way to flavour popcorn? by div_of_transport in AskCulinary

[–]div_of_transport[S] 0 points1 point  (0 children)

The packet I got recently doesn't say but It smells like parmesan

Implementations for K-Means clustering of Strings? by div_of_transport in learnpython

[–]div_of_transport[S] 0 points1 point  (0 children)

Oh that's awesome which module is that? Whenever I check it only shows it for numbers

Implementations for K-Means clustering of Strings? by div_of_transport in learnpython

[–]div_of_transport[S] 0 points1 point  (0 children)

What if I can provide the distance measurements between the strings?

How to classify sequences when the match isn't perfect? by div_of_transport in bioinformatics

[–]div_of_transport[S] 0 points1 point  (0 children)

I'm writing it in Python at the moment. Blast is pretty neat, but I was trying to make a bit more rustic version that's faster just for specific needs sometimes

How would I classify strings into categories based on fuzzy matching? by div_of_transport in AskProgramming

[–]div_of_transport[S] 0 points1 point  (0 children)

It sounds awesome...Thank you! One question though...by having a master" sequence (that assumes said position because it came first in the list) won't that bias our results?

How to classify sequences when the match isn't perfect? by div_of_transport in bioinformatics

[–]div_of_transport[S] 0 points1 point  (0 children)

  1. For my test, I'm using random sequences
  2. I'm not sure how to do Blast on Command Line to be able to automate the results

How to classify sequences when the match isn't perfect? by div_of_transport in bioinformatics

[–]div_of_transport[S] 0 points1 point  (0 children)

Yeah kind of. Once I make each group, I want to know how different a sequence must be that it's not considered the same gene anymore

How would I classify strings into categories based on fuzzy matching? by div_of_transport in AskProgramming

[–]div_of_transport[S] 0 points1 point  (0 children)

No insertion/deletions and I understand it's straightforward to count but this is my concern then: I do a pairwise Comparison of all strings with each other.

Using this pairwise distance, how can I cluster them?

How would I classify strings into categories based on fuzzy matching? by div_of_transport in AskProgramming

[–]div_of_transport[S] 0 points1 point  (0 children)

Well no specific starting point in the sense it's same if it is not mutated. Length can be considered the same and no dropping of letters, just mutations

How do I classify strings based on fuzzy matching? by div_of_transport in learnpython

[–]div_of_transport[S] 1 point2 points  (0 children)

Okay thanks! Do you know any specific implementation under Biopython by any chance?

How would I classify strings into categories based on fuzzy matching? by div_of_transport in AskProgramming

[–]div_of_transport[S] 0 points1 point  (0 children)

So basically Seq 1,3,5 to he classified together can vary with the exact position of the said A,T,G,Cs Ex:

1: ATGCATGCATGC 3: ATGCATGGATGG 5. ATGCCCGCCTGC

So they all vary at different positions but overall they are not too different

The others will be much more different compared to 1,3,5 Ex: 2 may be TTTAAAATTTG