By means of the technique of the imbedded Markov chain, an efficient algorithm is proposed to exactly calculate first, second moments of word counts and the ...
By means of the technique of the imbedded Markov chain, an efficient algorithm is proposed to exactly calculate first, second moments of word counts and the ...
By means of the technique of the imbedded Markov chain, an efficient algorithm is proposed to exactly calculate first, second moments of word counts and the ...
By means of the technique of the imbedded Markov chain, an efficient algorithm is proposed to exactly calculate first, second moments of word counts and the ...
Gao Shan, Wei-Mou Zheng: Counting of oligomers in Sequences Generated by Markov Chains for DNA Motif Discovery. J. Bioinform. Comput. Biol.
Jan 30, 2009 · This paper presents a novel motif-finding algorithm by evolving a population of Markov chains with information exchange (PMC), each of which is initialized as ...
Missing: oligomers | Show results with:oligomers
Counting of oligomers in sequences generated by markov chains for DNA motif discovery. Feb 7th, 2009, Shan G, Zheng WM. Journal of Bioinformatics and ...
Zheng W.M. Counting of oligomers in sequences generated by Markov chains for DNA motif discovery. J. Bioinform. Comput. Biol. 2009;7:39–54. doi: 10.1142 ...
All possible oligomers are counted with exact or the fuzzy matching for input sequences. ... Once the generated Markov chain is absorbed to a locally high ...
[27]. G. Shan, and W. M. Zheng, “Counting of oligomers in sequences generated by Markov chains for DNA motif discovery”, J. Bioinform.