Re: Prediction of mutations engineered by randomness in H5N1 hemagglutinins of influe
Dear All
Many thanks for your warm words and encouragements. Sorry for the delay in answering you because we were busy all the day, and until now we have time to see this website.
At first, let us talk several words regarding the logistic regression and neural network. As we wrote in our previous posts, assume that we have an equation ax + b = y for describing the cause-mutation relationship. We have said that y is the mutation, in fact, it is the occurrence/non-occurrence of mutation, which can be classified as unity and zero, a binary event. In such a case, on the left-hand side of equation we have continuous value, x, and on the right-hand side we have a binary event. This type of problem is the problem of classification, which can be solved using either logistic regression or neural network. At the beginning of our study on prediction of mutation, we used the logistic regression, which has an explicit form and works very fast. However, the logistic regression is not powerful enough, which is more suitable for concept-initiated study, and now we began to use the neural network, which is very time-consuming and does not have any explicit form. This is our current stage of studies.
With respect to the timing of mutation, we consider that the prediction of mutation should include (i) the prediction of mutation position, which we are trying to use the neural network to solve, (ii) the prediction of would-be-mutated amino acids at predicted positions, which we are trying to use the amino-acid mutating probability to solve, (iii) the timing of mutation, which we are trying to use the fast Fourier transform to solve, and (iv) the prediction of new function in mutant proteins.
The fast Fourier transform, in plain words, is a mathematic tool, which can find the periodicity in chaotic data, for example, we at first hope to find if there are periodicities in the figure in www.dreamscitech.com, whose periodicity is not easily to be seen in figure. When using the fast Fourier transform to treat the data from in figure, we can find that there are many periodicities. With the clear periodicities, we can time the mutations although there is still a long way to go.
Good weekend
Guang and Shaomin
Dear All
Many thanks for your warm words and encouragements. Sorry for the delay in answering you because we were busy all the day, and until now we have time to see this website.
At first, let us talk several words regarding the logistic regression and neural network. As we wrote in our previous posts, assume that we have an equation ax + b = y for describing the cause-mutation relationship. We have said that y is the mutation, in fact, it is the occurrence/non-occurrence of mutation, which can be classified as unity and zero, a binary event. In such a case, on the left-hand side of equation we have continuous value, x, and on the right-hand side we have a binary event. This type of problem is the problem of classification, which can be solved using either logistic regression or neural network. At the beginning of our study on prediction of mutation, we used the logistic regression, which has an explicit form and works very fast. However, the logistic regression is not powerful enough, which is more suitable for concept-initiated study, and now we began to use the neural network, which is very time-consuming and does not have any explicit form. This is our current stage of studies.
With respect to the timing of mutation, we consider that the prediction of mutation should include (i) the prediction of mutation position, which we are trying to use the neural network to solve, (ii) the prediction of would-be-mutated amino acids at predicted positions, which we are trying to use the amino-acid mutating probability to solve, (iii) the timing of mutation, which we are trying to use the fast Fourier transform to solve, and (iv) the prediction of new function in mutant proteins.
The fast Fourier transform, in plain words, is a mathematic tool, which can find the periodicity in chaotic data, for example, we at first hope to find if there are periodicities in the figure in www.dreamscitech.com, whose periodicity is not easily to be seen in figure. When using the fast Fourier transform to treat the data from in figure, we can find that there are many periodicities. With the clear periodicities, we can time the mutations although there is still a long way to go.
Good weekend
Guang and Shaomin
Comment