AN IMPROVED ALGORITHM FOR MULTIPLE SEQUENCE ALIGNMENT OF PROTEIN SEQUENCES USING GENETIC ALGORITHM
|
|
- Kevin Reginald Jennings
- 6 years ago
- Views:
Transcription
1 AN IMPROVED ALGORITHM FOR MULTIPLE SEQUENCE ALIGNMENT OF PROTEIN SEQUENCES USING GENETIC ALGORITHM Manish Kumar Department of Computer Science and Engineering, Indian School of Mines, Dhanbad , Jharkhand, India. *Corresponding Author: Manish Kumar, ABSTRACT One of the most fundamental operations in biological sequence analysis is multiple sequence alignment (MSA). The basic of multiple sequence alignment problems is to determine the most biologically plausible alignments of protein or DNA sequences. In this paper, an alignment method using genetic algorithm for multiple sequence alignment has been proposed. Two different genetic operators mainly crossover and mutation were defined and implemented with the proposed method in order to know the population evolution and quality of the sequence aligned. The proposed method is assessed with protein benchmark dataset, e.g., BALIBASE, by comparing the obtained results to those obtained with other alignment algorithms, e.g., SAGA, CLUSTAL W, MSA-GA and MSA-GA W/PREALIGN. Experiments on a wide range of data`s have shown that the proposed algorithm is much better (it terms of score) than previously proposed algorithms in its ability to achieve high alignment quality. KEYWORDS: Multiple Sequence Alignment; Genetic Algorithm; Crossover Operator; Mutation Operator. INTRODUCTION A multiple sequence alignment (MSA) (Hamidi et al, 2013) is a sequence alignment of three or more biological sequences, generally protein, DNA, or RNA (Auyeung and Melcher,2005). Sequence alignment is a standard technique in bioinformatics for visualizing the relationships between residues in a collection of evolutionarily or structurally related protein. Sequence alignment are extensively be used for improving the secondary and tertiary structure of protein and RNA sequences, which is used for drug designing and also to find distance between organism. In MSA, the emphasis is likely to find optimal alignment for a group of sequences. Several applicable techniques were observed in the past research, from traditional method such as dynamic programming to the extent of widely used stochastic optimization method such as Genetic Algorithms (GAs) (Peng et al, 2011) HMM (Eddy,1998) and Simulated Annealing (Kirkpatrick et al, 1983). MSA problems are solved using several different methods, such as classical, progressive (Kupis and 2007 ) and iterative algorithms (Mohsen et al,2007). These algorithms follow either global or local alignment (Changjin and Tewfik, 2009) strategies. In global alignments, sequences are aligned over their whole length. By contrast, local alignments identify regions of similarity within a sub sequence. Local alignments are often preferable, but can be more difficult because of the additional challenge of identifying the regions of similarity. A general global alignment technique is the Needleman Wunsch algorithm (Needleman and Wunsch,1970) which is based on dynamic programming. The Smith Waterman algorithm is a general local alignment method which is also based on dynamic programming. The dynamic programming (DP) approach (Zhimin and Zhong 2013) is good at finding the optimal alignment for two sequences. However, the complexity of this method grows significantly for three or more sequences. Note that MSA is a combinatorial problem (NP-hard) (Kececioglu and Starrett 2004) where the computational effort becomes prohibitive with a large number of sequences. The progressive alignment algorithm (tree-base algorithm), proposed by Feng and Doolittle (Feng and Dolittle 1987) iteratively utilizes the method of Needleman and Wunsch in order to obtain an MSA and to construct an evolutionary tree (Bhattacharjee et al. 2006) to depict the relationship between sequences. The progressive alignment algorithms align sequences according to the branching order of a guide tree. The difficulty with these methods is that they usually converge to local optima (Naznin et al., 2012). To overcome such a limitation, it is recommended to use an iterative or stochastic procedure. In this study, genetic algorithms (Pengfeiet al. 2010) have been considered for experimental analysis. The main advantage of using GA for MSA problem is that there is no need to provide a particular algorithm to solve a given problem. It only needs a fitness function to evaluate the quality of different solutions. Also since it is an implicitly parallel technique, it can be implemented very effectively on powerful parallel computers to solve exceptionally demanding large-scale problems. In the proposed method, our main objective is to align multiple protein sequences by using genetic algorithms. As protein sequences is an important application for the foreseeable future, therefore we have developed two new genetic Volume- 4 Issue- 3 (2015) ISSN: (p); (e) 2015 DAMA International. All rights reserved. 390
2 operators which is different from the tradition genetic operators and with the help of these genetic operators we have tried to solve the alignment problem of protein sequences. In the presented approach, we are able to align the protein sequences for most of the test cases (datasets) which can be observed by the obtained results. MATERIALS AND METHODS 1. Representation and Initial Generation In the proposed approach, the population is initially randomly generated at first. Then the largest sequence in size is determined. Based on the largest sequence size, the initially generated population is filled with gap sign until they reach the size of the biggest sequence plus a random number of gaps between 0 and 25% of the size of the largest loaded sequence. These gaps are randomly placed into the sequences. After the population s has initialized, all the solutions are combined and mutated, so as to produce new individuals with a defined number of generations (iterations), which is 50 for this experimental study. 2. Scoring Function In order to evaluate the fitness of the sequence alignment, the Sum of pair method (SPM) is used in this paper. Sum of Pair Method (SPM) By using SPM, the fitness of a multiple sequence alignment can be determined by using equation (1a) and (1b). In equation (1a), S is the cost of the multiple alignment. L is the length (columns) of alignment, S l is the cost of the l th column of L length. N is the number of sequences, A i (A j ) the aligned sequence i (j) and cost(a i,a j ) is the alignment score between the two aligned sequences A i and A j. When A i - and A j - then cost (A i, A j ) is determined from the PAM 250 matrix, a mutation probability matrix. The cost function includes the sum of the substitution costs of the insertion/deletions using a model with affine gap penalties as shown in (1b). Where, G is the gap penalty, g is the cost of opening a gap, x is the cost of extending the gap by one and n is the length of the gap. By this way, the fitness of a multiple sequence alignment is calculated. The complexity of this function is O(N2L). S = where = ) (1a) G = g + nx (1b) The score is calculated by scoring all the pair wise comparison between each residue in each column of an alignment and adding the scores together. This score will act as a measure to evaluate fitness of the population at each generation. Score for each column for the given sequences is calculated as per the data available in the PAM 250 Matrix. 3.Selection Strategies Description 3.1 Child Generation In order to generate a child population of 100 individuals in every generation, two genetic operators namely Crossover and Mutation have been considered for the experimental study, which is described below in details. 3.2 Crossover Operator It first chooses a column randomly in the parent alignments and defines a cut point there. Then by interchanging the different parts of parents it form two new offsprings, also known as Childs. For doing this type of operation gaps may be added to the resulting offsprings. E G K V A A W G A E D K V A K V N E E G V G G E A L E G K V A A A E G K V G A A E G E Y G A E AL E S K V A A A A A E S K V A G H A G A Y G A E AL Parent alignment 1 Parent alignment 2 E G K V A L W G A A E D K V K V N E E G V G G E A L A E G K V G A A E G E Y G A E A L E G K V A A A E S K V A G H A G A Y G A E A L E S K V A A A A A Child alignment 1 Child alignment 2 Figure 1. One point crossover. Volume- 4 Issue- 3 (2015) ISSN: (p); (e) 2015 DAMA International. All rights reserved. 391
3 4. Mutation Mutation is a divergence operation. It is intended to occasionally break one or more members of a population out of a local minimum/maximum space and potentially discover a better minimum/maximum space. Order changing - two numbers are randomly selected and exchanged ( ) => ( ) 5. New Generation For the coming generation, we have implemented a % selection scheme of parent child combination based on their fitness score. It means that for the coming generation 60% of the parent and 40% of the child population will be used to produce the next population. Other combinations such as % or the 50-50% parent- child population has also been considered but, these strategies has not shown any impact in improving the overall quality of the solution and hence not been considered. RESULTS The main objective of this research work is to observe the role of proposed crossover and mutation operators in solving MSA problem of protein sequences in terms of quality and scores of the sequence aligned. Here, quality of an aligned sequence is judged by the scores it obtains after successfully aligning. In this study, the experiments for the proposed approach have been performed using genetic algorithm with C programming on an Intel Core 2 Duo processor having 2.53 GHz CPU with 2 GB RAM running on the Linux platform. For evolution of the proposed approach, the algorithm were executed for 50 independent run (iterations) for 14 datasets. As, the fitness score depends upon the level of similarity among the residue in the sequences therefore, the scores can be either positive or negative. Here, one point is to be noted that if the residues among the comparable sequences are similar, then small numbers of gaps ( - ) are needed to make the sequences aligned properly. On the other hand, if the majority of the residues are dissimilar then a large number of gaps are needed for necessary sequence alignment. Performance of the Proposed Method with Ref. 1 The 14 datasets of reference 1 shown in table 1 are of different lengths and sequences. In order to compare the proposed method with respect to BAliscore, the proposed approach were compared with that of CLUSTAL W,MSA- GA, MSA-GA w/prealign and SAGA. From comparison it can be seen that out of 14 test cases, the proposed method has successfully overcome other methods solutions in 11 test cases and in three test cases, the proposed method solution were very close to the best. Table 1: Experimental results with Reference 1 Datasets of BAliBase 2.0 NAME OF DATASETS CLUSTAL W MSA-GA MSA-GA W/PREALIGN SAGA PROPOSED METHOD 1idy ar5A ad kinase krn myr Ref. 1 1ycc cyr taq ldg fieA sesA fxb amk Average score Volume- 4 Issue- 3 (2015) ISSN: (p); (e) 2015 DAMA International. All rights reserved. 392
4 Bali score Bali score Overall performance of proposed and others methods in reference CLUSTAL W MSA-GA MSA-GA w/prealign SAGA PROPOSED cyr,2-1taq,3-1ldg,4-1fieA,5-1sesA,6-2fxb,7-1amk Figure 2. Bar graph comparison result of scores between proposed and other methods over ref Overall performance of proposed and other methods in reference 1 CLUSTAL W MSA-GA MSA-GA w/prealign SAGA PROPOSED idy,2-1ar5A,3-1ad2,4-kinase,5-1krn,6-2myr,7-1ycc Figure 3. Bar graph comparison result of scores between proposed and other methods over ref.1 DISCUSSIONS In this paper, a novel approach has been developed, which uses genetic algorithm for performing multiple sequence alignment. The objective of this study is to validate the efficacy of the proposed approach and assess it by comparing with other commonly used algorithms for MSA over different datasets. In order to evaluate the efficiency and feasibility of the proposed approach, a benchmark datasets from BAliBase 2.0 is considered, because most of the methods discussed in this paper uses BaliBase datasets to access the quality of the multiple sequence alignments. When compared to other methods, the proposed method improves the overall quality of the alignment. The experimental result provides a better scope for multiple sequences alignment, as there is a increase in the alignment quality, which can be observed by the scores of different datasets. It was also observed that the proposed method solution gives some unsatisfied results in some test cases. To this respect the conclusion that can be drawn is that the novel approach proposed in this paper obtains very promising protein sequences that significantly surpass previously published results in most of the cases. REFERENCES Auyeung A. and Melcher U. (2005). Evaluations of protein sequence alignments using structural information. Int. Con. Info. Tech. Coding Computing. 2: Bhattacharjee A; Sultana K.Z. and Shams Z. (2006). Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction. Canadian Con. Electrical Computer Engineering Changjin H. and Tewfik A.H. (2009). Heuristic Reusable Dynamic Programming: Efficient Updates of Local Sequence Alignment. IEEE/ACM Transactions Computational Biol. Bioinfo. 6(4): Volume- 4 Issue- 3 (2015) ISSN: (p); (e) 2015 DAMA International. All rights reserved. 393
5 Eddy S. (1998). Profile hidden Markov models. Bioinformatics. 14: Feng D. F. and Dolittle R. F. (1987). Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol. 25(4): Hamidi S; Naghibzadeh M. and Sadri J. (2013). Protein multiple sequence alignment based on secondary structure similarity. Int. Con. Advances Computing, Communications Info Kirkpatrick S., Gelatt J.C.D. and Vecchi M. P. (1983). Optimization by simulated annealing. Sci. 220 : Kececioglu J. and Starrett D. (2004). Aligning alignments exactly. RECOMB. Kupis P. and Mandziuk J. (2007). Evolutionary-Progressive Method for Multiple Sequence Alignment. IEEE Symposium Computational Intelligence Bioinfo. Computational Biol Mohsen B., Balaji P; Devavrat S. and Mayank S (2007) Iterative Scheduling Algorithms. IEEE INFOCOM proceedings. Naznin F., Sarker R. and Essam D. (2012). Progressive Alignment Method Using Genetic Algorithm for Multiple Sequence Alignment. IEEE Transactions on Evolutionary Computation. 16(5): Needleman S. B. and Wunsch C. D. (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3) : Peng Y; Dong C. and Zheng H. (2011). Research on Genetic Algorithm Based on Pyramid Model 2nd International Symposium on Intelligence Information Processing Trusted Computing Pengfei G., Xuezhi Wa. and Yingshi H. (2010). The enhanced genetic algorithms for the optimization design. 3rd Int.l Con. Biomedical Engineering Info. 7: Zhimin Z. H. and Zhong W. C. (2013). Dynamic Programming For Protein Sequence Alignment. International J. BioSci. Bio Tech.. 5(2). Volume- 4 Issue- 3 (2015) ISSN: (p); (e) 2015 DAMA International. All rights reserved. 394
A NOVEL AND EFFICIENT APPROACH FOR ALIGNMENT OF PROTEIN BIOMOLECULES THROUGH RESERVE SELECTION SCHEME
A NOVEL AND EFFICIENT APPROACH FOR ALIGNMENT OF PROTEIN BIOMOLECULES THROUGH RESERVE SELECTION SCHEME * Manish Kumar and Haider Banka Department of CSE, Indian School of Mines, Dhanbad-826004, India *
More informationOriginal article: AN ENHANCED ALGORITHM FOR MULTIPLE SEQUENCE ALIGNMENT OF PROTEIN SEQUENCES USING GENETIC ALGORITHM Manish Kumar
Original article: AN ENHANCED ALGORITHM FOR MULTIPLE SEQUENCE ALIGNMENT OF PROTEIN SEQUENCES USING GENETIC ALGORITHM Manish Kumar Department of Computer Science and Engineering, Indian School of Mines,
More informationChanging Mutation Operator of Genetic Algorithms for optimizing Multiple Sequence Alignment
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 11 (2013), pp. 1155-1160 International Research Publications House http://www. irphouse.com /ijict.htm Changing
More informationAn Evolutionary Optimization for Multiple Sequence Alignment
195 An Evolutionary Optimization for Multiple Sequence Alignment 1 K. Lohitha Lakshmi, 2 P. Rajesh 1 M tech Scholar Department of Computer Science, VVIT Nambur, Guntur,A.P. 2 Assistant Prof Department
More informationOptimizing Genetic Algorithm Parameters for Multiple Sequence Alignment Based on Structural Information
Advanced Studies in Biology, Vol. 8, 2016, no. 1, 9-16 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/asb.2016.51250 Optimizing Genetic Algorithm Parameters for Multiple Sequence Alignment Based
More informationOptimization of Process Parameters of Global Sequence Alignment Based Dynamic Program - an Approach to Enhance the Sensitivity.
Optimization of Process Parameters of Global Sequence Alignment Based Dynamic Program - an Approach to Enhance the Sensitivity of Alignment Dr.D.Chandrakala 1, Dr.T.Sathish Kumar 2, S.Preethi 3, D.Sowmya
More informationCreation of a PAM matrix
Rationale for substitution matrices Substitution matrices are a way of keeping track of the structural, physical and chemical properties of the amino acids in proteins, in such a fashion that less detrimental
More informationApplication of Evolutionary Algorithms for Multiple Sequence Alignment
Application of Evolutionary Algorithms for Multiple Sequence Alignment Rahul Choudhury BIOC 218 Stanford University SUNetID: rahul99 Abstract Multiple Sequence Alignment is a crucial task in Bioinformatics.
More informationDynamic Programming Algorithms
Dynamic Programming Algorithms Sequence alignments, scores, and significance Lucy Skrabanek ICB, WMC February 7, 212 Sequence alignment Compare two (or more) sequences to: Find regions of conservation
More informationGenetic Algorithm: An Optimization Technique Concept
Genetic Algorithm: An Optimization Technique Concept 1 Uma Anand, 2 Chain Singh 1 Student M.Tech (3 rd sem) Department of Computer Science Engineering Dronacharya College of Engineering, Gurgaon-123506,
More informationCHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING
79 CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING The present chapter proposes a hybrid intelligent approach (IPSO-AIS) using Improved Particle Swarm Optimization (IPSO) with
More informationPARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM
PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -
More informationDNA Sequence Alignment based on Bioinformatics
DNA Sequence Alignment based on Bioinformatics Shivani Sharma, Amardeep singh Computer Engineering,Punjabi University,Patiala,India Email: Shivanisharma89@hotmail.com Abstract: DNA Sequence alignmentis
More informationOptimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing
More informationApplying Computational Intelligence in Software Testing
www.stmjournals.com Applying Computational Intelligence in Software Testing Saumya Dixit*, Pradeep Tomar School of Information and Communication Technology, Gautam Buddha University, Greater Noida, India
More informationImplementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms
Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms Karishma Mendiratta #1, Ankush Goyal *2 #1 M.Tech. Scholar, *2 Assistant Professor, Department of Computer
More informationGenetic Algorithm for Predicting Protein Folding in the 2D HP Model
Genetic Algorithm for Predicting Protein Folding in the 2D HP Model A Parameter Tuning Case Study Eyal Halm Leiden Institute of Advanced Computer Science, University of Leiden Niels Bohrweg 1 2333 CA Leiden,
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationScoring Alignments. Genome 373 Genomic Informatics Elhanan Borenstein
Scoring Alignments Genome 373 Genomic Informatics Elhanan Borenstein A quick review Course logistics Genomes (so many genomes) The computational bottleneck Python: Programs, input and output Number and
More informationWhat is Bioinformatics? Bioinformatics is the application of computational techniques to the discovery of knowledge from biological databases.
What is Bioinformatics? Bioinformatics is the application of computational techniques to the discovery of knowledge from biological databases. Bioinformatics is the marriage of molecular biology with computer
More informationAvailable online at International Journal of Current Research Vol. 9, Issue, 07, pp , July, 2017
z Available online at http://www.journalcra.com International Journal of Current Research Vol. 9, Issue, 07, pp.53529-53533, July, 2017 INTERNATIONAL JOURNAL OF CURRENT RESEARCH ISSN: 0975-833X RESEARCH
More informationEvolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree
Evolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree A. SADEGHEIH Department of Industrial Engineering University of Yazd, P.O.Box: 89195-741 IRAN, YAZD
More informationAC Algorithms for Mining Biological Sequences (COMP 680)
AC-04-18 Algorithms for Mining Biological Sequences (COMP 680) Instructor: Mathieu Blanchette School of Computer Science and McGill Centre for Bioinformatics, 332 Duff Building McGill University, Montreal,
More informationModeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms
Computer Technology and Application 2 (2011) 487-499 Modeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms Son
More informationEvolutionary Algorithms
Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or
More informationBioinformatics Practical Course. 80 Practical Hours
Bioinformatics Practical Course 80 Practical Hours Course Description: This course presents major ideas and techniques for auxiliary bioinformatics and the advanced applications. Points included incorporate
More informationExtracting Database Properties for Sequence Alignment and Secondary Structure Prediction
Available online at www.ijpab.com ISSN: 2320 7051 Int. J. Pure App. Biosci. 2 (1): 35-39 (2014) International Journal of Pure & Applied Bioscience Research Article Extracting Database Properties for Sequence
More informationData Mining for Biological Data Analysis
Data Mining for Biological Data Analysis Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References Data Mining Course by Gregory-Platesky Shapiro available at www.kdnuggets.com Jiawei Han
More informationA HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING
A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING PROF. SARVADE KISHORI D. Computer Science and Engineering,SVERI S College Of Engineering Pandharpur,Pandharpur,India KALSHETTY Y.R. Assistant Professor
More informationCHAPTER 5 EMISSION AND ECONOMIC DISPATCH PROBLEMS
108 CHAPTER 5 EMISSION AND ECONOMIC DISPATCH PROBLEMS 5.1 INTRODUCTION The operation and planning of a power system is characterized by having to maintain a high degree of economy and reliability. Among
More informationEvolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints
Evolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints Tzung-Pei Hong 1, 2, Pei-Chen Sun 3, and Sheng-Shin Jou 3 1 Department of Computer Science and Information Engineering
More informationBioinformatics for Biologists. Comparative Protein Analysis
Bioinformatics for Biologists Comparative Protein nalysis: Part I. Phylogenetic Trees and Multiple Sequence lignments Robert Latek, PhD Sr. Bioinformatics Scientist Whitehead Institute for Biomedical Research
More informationEvolutionary Computation
Evolutionary Computation Evolution and Intelligent Besides learning ability, intelligence can also be defined as the capability of a system to adapt its behaviour to ever changing environment. Evolutionary
More informationAssoc. Prof. Rustem Popa, PhD
Dunarea de Jos University of Galati-Romania Faculty of Electrical & Electronics Engineering Dep. of Electronics and Telecommunications Assoc. Prof. Rustem Popa, PhD http://www.etc.ugal.ro/rpopa/index.htm
More informationCHAPTER 3 RESEARCH METHODOLOGY
72 CHAPTER 3 RESEARCH METHODOLOGY Inventory management is considered to be an important field in Supply chain management. Once the efficient and effective management of inventory is carried out throughout
More informationCloud Load Balancing Based on ACO Algorithm
Cloud Load Balancing Based on ACO Algorithm Avtar Singh, Kamlesh Dutta, Himanshu Gupta Department of Computer Science, National Institute of Technology,Hamirpur, HP, India Department of Computer Science,
More informationProcessor Scheduling Algorithms in Environment of Genetics
Processor Scheduling Algorithms in Environment of Genetics Randeep Department of Computer Science and Engineering R.N. College of Engg. & Technology Haryana, India randeepravish@gmail.com Abstract The
More informationInferring Gene Networks from Microarray Data using a Hybrid GA p.1
Inferring Gene Networks from Microarray Data using a Hybrid GA Mark Cumiskey, John Levine and Douglas Armstrong johnl@inf.ed.ac.uk http://www.aiai.ed.ac.uk/ johnl Institute for Adaptive and Neural Computation
More informationRule Minimization in Predicting the Preterm Birth Classification using Competitive Co Evolution
Indian Journal of Science and Technology, Vol 9(10), DOI: 10.17485/ijst/2016/v9i10/88902, March 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Rule Minimization in Predicting the Preterm Birth
More informationThe Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment
Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci
More informationComparative Bioinformatics. BSCI348S Fall 2003 Midterm 1
BSCI348S Fall 2003 Midterm 1 Multiple Choice: select the single best answer to the question or completion of the phrase. (5 points each) 1. The field of bioinformatics a. uses biomimetic algorithms to
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationIdentifying Regulatory Regions using Multiple Sequence Alignments
Identifying Regulatory Regions using Multiple Sequence Alignments Prerequisites: BLAST Exercise: Detecting and Interpreting Genetic Homology. Resources: ClustalW is available at http://www.ebi.ac.uk/tools/clustalw2/index.html
More informationGenetic Algorithms in Matrix Representation and Its Application in Synthetic Data
Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University
More informationGenetic Algorithms for Optimizations
Genetic Algorithms for Optimizations 1. Introduction Genetic Algorithms (GAs) are developed to mimic some of the processes observed in natural evolution. GAs use the concept of Darwin's theory of evolution
More informationBasic Local Alignment Search Tool
14.06.2010 Table of contents 1 History History 2 global local 3 Score functions Score matrices 4 5 Comparison to FASTA References of BLAST History the program was designed by Stephen W. Altschul, Warren
More informationThe application of hidden markov model in building genetic regulatory network
J. Biomedical Science and Engineering, 2010, 3, 633-637 doi:10.4236/bise.2010.36086 Published Online June 2010 (http://www.scirp.org/ournal/bise/). The application of hidden markov model in building genetic
More informationDesigning a Forest Road Network using Heuristic Optimization Techniques
Designing a Forest Road Network using Heuristic Optimization Techniques Woodam Chung and John Sessions Graduate Research Assistant and Professor, respectively, Department of Forest Engineering, Oregon
More informationPARALLELIZATION OF HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHM FOR SHORT-TERM PRODUCTION SCHEDULING
PARALLELIZATION OF HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHM FOR SHORT-TERM PRODUCTION SCHEDULING Karl Kurbel # Bernd Schneider # Kirti Singh + # Institute of Business Informatics, University of
More informationIntegration of Process Planning and Job Shop Scheduling Using Genetic Algorithm
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 1 Integration of Process Planning and Job Shop Scheduling Using
More informationClassification and Learning Using Genetic Algorithms
Sanghamitra Bandyopadhyay Sankar K. Pal Classification and Learning Using Genetic Algorithms Applications in Bioinformatics and Web Intelligence With 87 Figures and 43 Tables 4y Spri rineer 1 Introduction
More informationFinding Regularity in Protein Secondary Structures using a Cluster-based Genetic Algorithm
Finding Regularity in Protein Secondary Structures using a Cluster-based Genetic Algorithm Yen-Wei Chu 1,3, Chuen-Tsai Sun 3, Chung-Yuan Huang 2,3 1) Department of Information Management 2) Department
More informationA Protein Secondary Structure Prediction Method Based on BP Neural Network Ru-xi YIN, Li-zhen LIU*, Wei SONG, Xin-lei ZHAO and Chao DU
2017 2nd International Conference on Artificial Intelligence: Techniques and Applications (AITA 2017 ISBN: 978-1-60595-491-2 A Protein Secondary Structure Prediction Method Based on BP Neural Network Ru-xi
More informationGenetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3
Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3 1,2,3 Y. S. R Engineering College, Yogi Vemana University Korrapad Road, Proddatur 516360, India 1 shaikfaroq@gmail.com,
More informationStructural Bioinformatics (C3210) Conformational Analysis Protein Folding Protein Structure Prediction
Structural Bioinformatics (C3210) Conformational Analysis Protein Folding Protein Structure Prediction Conformational Analysis 2 Conformational Analysis Properties of molecules depend on their three-dimensional
More informationProGen: GPHMM for prokaryotic genomes
ProGen: GPHMM for prokaryotic genomes Sharad Akshar Punuganti May 10, 2011 Abstract ProGen is an implementation of a Generalized Pair Hidden Markov Model (GPHMM), a model which can be used to perform both
More informationAn introduction to multiple alignments
An introduction to multiple alignments original version by Cédric Notredame, updated by Laurent Falquet Overview! Multiple alignments! How-to, Goal, problems, use! Patterns! PROSITE database, syntax, use!
More informationIMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM
IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization
More informationSingle alignment: FASTA. 17 march 2017
Single alignment: FASTA 17 march 2017 FASTA is a DNA and protein sequence alignment software package first described (as FASTP) by David J. Lipman and William R. Pearson in 1985.[1] FASTA is pronounced
More informationUse of Genetic Algorithms in Discrete Optimalization Problems
Use of Genetic Algorithms in Discrete Optimalization Problems Alena Rybičková supervisor: Ing. Denisa Mocková PhD Faculty of Transportation Sciences Main goals: design of genetic algorithm for vehicle
More informationGENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS
GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS SANJAY S, PRADEEP S, MANIKANTA V, KUMARA S.S, HARSHA P Department of Human Resource Development CSIR-Central Food
More informationReducing Premature Convergence Problem in Genetic Algorithm: Application on Travel Salesman Problem
Computer and Information Science; Vol. 6, No. 1; 2013 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Science and Education Reducing Premature Convergence Problem in Genetic Algorithm:
More informationA Particle Swarm Optimization Approach for Workflow Scheduling on Cloud Resources Priced by CPU Frequency
A Particle Swarm Optimization Approach for Workflow Scheduling on Cloud Resources Priced by CPU Frequency Thiago A. L. Genez, Ilia Pietri, Rizos Sakellariou, Luiz F. Bittencourt and Edmundo R. M. Madeira
More informationAn Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems
An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems Son Duy Dao, Kazem Abhary, and Romeo Marian Abstract Traveling salesman problem (TSP) is an important optimization problem in
More informationTextbook Reading Guidelines
Understanding Bioinformatics by Marketa Zvelebil and Jeremy Baum Last updated: May 1, 2009 Textbook Reading Guidelines Preface: Read the whole preface, and especially: For the students with Life Science
More informationAdvisors: Prof. Louis T. Oliphant Computer Science Department, Hiram College.
Author: Sulochana Bramhacharya Affiliation: Hiram College, Hiram OH. Address: P.O.B 1257 Hiram, OH 44234 Email: bramhacharyas1@my.hiram.edu ACM number: 8983027 Category: Undergraduate research Advisors:
More informationRepeated Sequences in Genetic Programming
Repeated Sequences in Genetic Programming W. B. Langdon Computer Science 29.6.2012 1 Introduction Langdon + Banzhaf in Memorial University, Canada Emergence: Repeated Sequences Repeated Sequences in Biology
More informationTimetabling with Genetic Algorithms
Timetabling with Genetic Algorithms NADIA NEDJAH AND LUIZA DE MACEDO MOURELLE Department of de Systems Engineering and Computation, State University of Rio de Janeiro São Francisco Xavier, 524, 5 O. Andar,
More informationGENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH
International Journal of Engineering Research and Applications (IJERA) ISSN: 48-96 National Conference on Emerging Trends in Engineering & Technology (VNCET-30 Mar 1) GENETIC ALGORITHM A NOBLE APPROACH
More informationMulti-objective Evolutionary Optimization of Cloud Service Provider Selection Problems
Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw
More informationA New Hybrid Model to find The Dominant Pattern of Amino Acid Sequence to using Data Mining
A New Hybrid Model to find The Dominant Pattern of Amino Acid Sequence to using Data Mining Dimpal Prajapati, Prof. Riya Parmar Computer Science & Engineering, LDRP-ITR, Gujarat, India Abstract- Data Mining
More informationBioinformation by Biomedical Informatics Publishing Group
Algorithm to find distant repeats in a single protein sequence Nirjhar Banerjee 1, Rangarajan Sarani 1, Chellamuthu Vasuki Ranjani 1, Govindaraj Sowmiya 1, Daliah Michael 1, Narayanasamy Balakrishnan 2,
More informationMotif Discovery from Large Number of Sequences: a Case Study with Disease Resistance Genes in Arabidopsis thaliana
Motif Discovery from Large Number of Sequences: a Case Study with Disease Resistance Genes in Arabidopsis thaliana Irfan Gunduz, Sihui Zhao, Mehmet Dalkilic and Sun Kim Indiana University, School of Informatics
More informationINTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011
Minimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm Kumar A. 1 *, Dhingra A. K. 1 1Department of Mechanical Engineering, University Institute of
More information10. Lecture Stochastic Optimization
Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation
More informationMachine Learning: Algorithms and Applications
Machine Learning: Algorithms and Applications Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2011-2012 Lecture 4: 19 th March 2012 Evolutionary computing These
More informationArticle A Teaching Approach From the Exhaustive Search Method to the Needleman Wunsch Algorithm
Article A Teaching Approach From the Exhaustive Search Method to the Needleman Wunsch Algorithm Zhongneng Xu * Yayun Yang Beibei Huang, From the Department of Ecology, Jinan University, Guangzhou 510632,
More informationDesign and Implementation of Genetic Algorithm as a Stimulus Generator for Memory Verification
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 9, September, 2015, PP 18-24 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Design and Implementation of Genetic
More informationEVOLUTIONARY ALGORITHMS AT CHOICE: FROM GA TO GP EVOLŪCIJAS ALGORITMI PĒC IZVĒLES: NO GA UZ GP
ISSN 1691-5402 ISBN 978-9984-44-028-6 Environment. Technology. Resources Proceedings of the 7 th International Scientific and Practical Conference. Volume I1 Rēzeknes Augstskola, Rēzekne, RA Izdevniecība,
More informationValidity Constraints and the TSP GeneRepair of Genetic Algorithms
Validity Constraints and the TSP GeneRepair of Genetic Algorithms George G. Mitchell Department of Computer Science National University of Ireland, Maynooth Ireland georgem@cs.nuim.ie Abstract In this
More informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
More informationGENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.
GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary
More informationImproving Differential Evolution Algorithm with Activation Strategy
2009 International Conference on Machine Learning and Computing IPCSIT vol.3 (2011) (2011) IACSIT Press, Singapore Improving Differential Evolution Algorithm with Activation Strategy Zhan-Rong Hsu 1, Wei-Ping
More informationPart 1: Motivation, Basic Concepts, Algorithms
Part 1: Motivation, Basic Concepts, Algorithms 1 Review of Biological Evolution Evolution is a long time scale process that changes a population of an organism by generating better offspring through reproduction.
More informationAn Analytical Upper Bound on the Minimum Number of. Recombinations in the History of SNP Sequences in Populations
An Analytical Upper Bound on the Minimum Number of Recombinations in the History of SNP Sequences in Populations Yufeng Wu Department of Computer Science and Engineering University of Connecticut Storrs,
More informationGenetic algorithms. History
Genetic algorithms History Idea of evolutionary computing was introduced in the 1960s by I. Rechenberg in his work "Evolution strategies" (Evolutionsstrategie in original). His idea was then developed
More informationGROUP elevator scheduling is important to transportation
352 IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 7, NO. 2, APRIL 2010 Optimization of Group Elevator Scheduling With Advance Information Jin Sun, Student Member, IEEE, Qian-Chuan Zhao,
More informationImaging informatics computer assisted mammogram reading Clinical aka medical informatics CDSS combining bioinformatics for diagnosis, personalized
1 2 3 Imaging informatics computer assisted mammogram reading Clinical aka medical informatics CDSS combining bioinformatics for diagnosis, personalized medicine, risk assessment etc Public Health Bio
More informationSequence Alignment and Phylogenetic Tree Construction of Malarial Parasites
72 Sequence Alignment and Phylogenetic Tree Construction of Malarial Parasites Sk. Mujaffor 1, Tripti Swarnkar 2, Raktima Bandyopadhyay 3 M.Tech (2 nd Yr.), ITER, S O A University mujaffor09 @ yahoo.in
More informationPI-Controller Tuning For Heat Exchanger with Bypass and Sensor
International Journal of Electrical Engineering. ISSN 0974-2158 Volume 5, Number 6 (2012), pp. 679-689 International Research Publication House http://www.irphouse.com PI-Controller Tuning For Heat Exchanger
More informationIntroduction To Genetic Algorithms
Introduction To Genetic Algorithms Cse634 DATA MINING Professor Anita Wasilewska Computer Science Department Stony Brook University 1 Overview Introduction To Genetic Algorithms (GA) GA Operators and Parameters
More informationIntro. ANN & Fuzzy Systems. Lecture 36 GENETIC ALGORITHM (1)
Lecture 36 GENETIC ALGORITHM (1) Outline What is a Genetic Algorithm? An Example Components of a Genetic Algorithm Representation of gene Selection Criteria Reproduction Rules Cross-over Mutation Potential
More informationGenetic algorithms and code optimization. A quiet revolution
Genetic algorithms and code optimization Devika Subramanian Rice University Work supported by DARPA and the USAF Research Labs A quiet revolution (May 1997) Deep Blue vs Kasparaov first match won against
More informationFeature Selection for Predictive Modelling - a Needle in a Haystack Problem
Paper AB07 Feature Selection for Predictive Modelling - a Needle in a Haystack Problem Munshi Imran Hossain, Cytel Statistical Software & Services Pvt. Ltd., Pune, India Sudipta Basu, Cytel Statistical
More informationA Multi-Period MPS Optimization Using Linear Programming and Genetic Algorithm with Capacity Constraint
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 08, Issue 01 (January. 2018), V1 PP 85-93 www.iosrjen.org A Multi-Period MPS Optimization Using Linear Programming and
More informationBIOINFORMATICS Introduction
BIOINFORMATICS Introduction Mark Gerstein, Yale University bioinfo.mbb.yale.edu/mbb452a 1 (c) Mark Gerstein, 1999, Yale, bioinfo.mbb.yale.edu What is Bioinformatics? (Molecular) Bio -informatics One idea
More informationTheory and Application of Multiple Sequence Alignments
Theory and Application of Multiple Sequence Alignments a.k.a What is a Multiple Sequence Alignment, How to Make One, and What to Do With It Brett Pickett, PhD History Structure of DNA discovered (1953)
More informationSimulation approaches for optimization in business and service systems
Simulation approaches for optimization in business and service systems Imed Kacem kacem@univ-metz.fr Professor - Université Paul Verlaine Metz http://kacem.imed.perso.neuf.fr/site/ FUBUTEC 2, Future Business
More informationPerformance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray Value
American Journal of Applied Sciences 9 (8): 1268-1272, 2012 ISSN 1546-9239 2012 Science Publications Performance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray Value 1 Vishnu Raja, P.
More informationThe Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku
The Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku Nordin Abu Bakar, Muhammad Fadhil Mahadzir Faculty of Computer & Mathematical
More information