Guys I just ran an analysis on Covid19 and the HIV genome

Guys I just ran an analysis on Covid19 and the HIV genome.

ncbi.nlm.nih.gov/nuccore/MN908947
ncbi.nlm.nih.gov/nuccore/9629357

Covid19 has 29903 base pairs, HIV has 9181 base pairs. The longest common subsequence has the length of 9012 basepairs!

Luc Montagnier is correct, the HIV genome is contained in Covid-19

Attached: 1584077982002.jpg (600x800, 95.46K)

Other urls found in this thread:

en.wikipedia.org/wiki/Longest_common_subsequence_problem#Reading_out_a_LCS
pastiebin.com/5e9ce2c08c5ee
asianscientist.com/2020/02/topnews/china-coronavirus-covid-19-study/
youtu.be/bCy0sm2rMDs
ncbi.nlm.nih.gov/genbank/sars-cov-2-seqs/
twitter.com/NSFWRedditVideo

What does that mean?

>Makes thread with provocative photo
discarded

Break it down for us user, I'm listening, explain like we're all retarded, because we are, thanks!

Run this script if you don't believe me:

import os
import sys
import numpy as np


def prepSequence(filename):
with open(filename, 'r') as sequence:
temp = sequence.readlines()

temp = map(lambda x: x.strip(), temp) # Removing newline chars
temp = sum(map(lambda x: x.split(' '), temp), []) # Joining list of lines
temp = filter(lambda x: x is not '', temp) # Removing empty strings
temp = filter(lambda x: not x.isdigit(), temp) # Removing gene numbering
return list(temp)


def LCSLength(A, B):
m = len(A)
n = len(B)
C = np.zeros((m, n))
for i in range(1, m):
for j in range(1, n):
if A[i] == B[j]:
C[i][j] = C[i-1][j-1] + 1
else:
C[i][j] = max(C[i][j-1], C[i-1][j])
return C[m-1][n-1]


def main():
covid19 = ''.join(prepSequence('covid19'))
hiv = ''.join(prepSequence('hiv'))
print(len(covid19))
print(len(hiv))

print(LCSLength(covid19, hiv))

if __name__ == '__main__':
main()

It's pretty slow since it's not really optimized, but it does the job.

Any nudes of this chick?

en.wikipedia.org/wiki/Longest_common_subsequence_problem#Reading_out_a_LCS

this is the algorithm I ran on the sequences.

Does Coffee contain HIV inserts?

Retard.

Shoo.