Open Access Open Access  Restricted Access Subscription or Fee Access

Data Optimization from a Multiple Species Network using Modified SFLA (Shuffled Frog Leaping Algorithm)

N. Kannaiya Raja, Dr.K. Arulanandam, S.K. Sugunedham


In this work we present a novel approach that uses interspecies sequences homology to connect the networks of multi species and possible more species and possible more species together with gene ontology dependencies in order to improve protein classification for research work. Proteins are involved in many for all biological process such energy metabolism, signal transduction and translation initiation. Even though for a large portion of proteins and their biological function are unknown or incomplete, therefore constructing efficient and reliable models for predicting the protein function has to be used in research work. Our method readily extends to multi species food and produce the improvements similar to them multi species. In the presence of multi interacting networks are using data mining for integration of a data from various sources and contributing increased accuracy of the function prediction of the multiple species for research work. We further enhance our model to account for the gene ontology dependencies by linking multiple related ontology categories such as, we have selected the food items from various countries such as from America the famous food items of yoghurt and Australia food items of oats and Indian food items of soya bean. The data sets are highly desirable for this use from various countries using logical networks from center for bioinformatics research institute (Chennai) and stored in the mining. SFLA aims to set a generic paradism of the efficient mining that acquire the data set of proteins for these food items and promotes predictions of protein functions with gene ontology for research work.


Biology and Genetics, Machine Learning, Bioinformatics (Genome or Protein) Databases.

Full Text:



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.