• Nenhum resultado encontrado

DNA Motif Discovery Based on Ant Colony Optimization and Expectation Maximization

N/A
N/A
Protected

Academic year: 2017

Share "DNA Motif Discovery Based on Ant Colony Optimization and Expectation Maximization"

Copied!
6
0
0

Texto

Loading

Imagem

Fig. 1  An example for the consensus string “TATAA” can be represented  by the route s→T→A→T→A→A→e
Fig. 2  The framework of the proposed motif discovery method.
Table II

Referências

Documentos relacionados

The proposed method first roughly identifies the possible classes of the test sample, and then establishes a minimum squared error (MSE) model based on the training samples from

However, as shown in Figure 6b, AMD automatically identified 15 of 19 informative positions of the expected motif [22], Amadeus identified 12 of the positions at its maximal

Based on the results of our proposed method, fusion of classifiers on two data sets improves classification accuracy. Based on these results, proposed classifier

The analysis has revealed that identification method based on the interstellar angular distances provides star identification with higher reliability and several times faster than

We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO), named Ant-Based Phylogenetic Reconstruction (ABPR).. ABPR joins two

Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization. Modifications and additions to ant colony optimization to solve the

Moreover, DiscMU, in which we incorporate simulated evolution and under-sampling into the discriminative HMM training method, finds the same number of motifs in known targeting

To further test the reliability of our database in gene discovery, the full length cDNAs encoding TtPax1/9a and TtPax1/9b proteins were cloned based on the partial sequences