how to transcribe dna sequence

() {intTscanf("%d", t); for(intck=1; ckscanf("%d", n); for(intI=0; iscanf('%s ', Inpt[i]); tlen[i]=strlen(Inpt[i]); } queueQue Setint>Vis Que.push (Data (0,0)); while(Que.size ()) {Data u=que.front ();int*used=decode (U.mask);if(check (used)) {printf("%d\n", u.res); Break;}BOOLban[Ten]={0}; for(intI=0; iinttemp[Ten];if(used[i]>=tlen[i]| | Ban[i])Continue;CharNxt=inpt[i][used[i]]; for(intj=0; jif(Temp[j]>=tlen[j])Continue;if(INPT[J][TEMP[J]]==NXT) {temp[j]++; ban[j]=1; }

Topic Link: DNA SequenceAnalysis: AC automata + matrix acceleration (fast power).The idea of a state transfer diagram for an AC automaton at this time is very thorough, and the AC automata is the ability to determine the transfer of the state.AC Code:#include Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. POJ 2778 DNA

http://acm.hdu.edu.cn/showproblem.php?pid=1560Read the question carefully (!), you can find that the problem requires a shortest string, the string of discontinuous subsequence contains all the strings given by the topicBecause there are only 40 characters in total, try searching using a *1. Store the state directly stored 40 characters, 4 of each character may not be sure.Because it is required to include a discontinuous subsequence, just remember that the current string length is the length of

The main problem: give the M disease gene fragment (mAnalysis: The subject needs to build an AC automaton for the gene fragments of M disease, and each node in the automaton represents a state. The leaf nodes in the AC automata represent viruses, so they are illegal. At the same time, if a node to the root of the string suffix is a virus, then the node is also an illegal state. Eliminate all illegal state, then the rest of the nodes are in the legal state. The node's NXT pointer is then used to

string to result -String temp = s.substring (i-9, i+1); - Result.add (temp); - } - } in } - for(String item:result) { to Res.add (item); + } - returnRes; the } *}Naive method:1 Public classSolution {2 PublicListfindrepeateddnasequences (String s) {3arraylistNewArraylist();4 if(s==NULL|| S.length () returnRes;5 for(inti=0; I) {6String cur = s.substring (i, i+10);7 for(intj=i+1; J) {8String comp =