Cornish, JosephForder, RobertErill, IvanGobbert, Matthias K.2018-10-252018-10-252011-07-30http://hdl.handle.net/11603/11696The analysis of transcription factor binding motifs may aid in understanding the process by which transcription factors recognize their binding sites. We wish to investigate the likelihood that transcription factors use correlation between positions instead of conservation of single positions as a mechanism for binding site recognition. We implement a genetic algorithm in parallel using a server-client organization to simulate the evolution of these binding sites. A performance analysis of the parallel algorithm showed significantly improved performance over the serial counterpart. The results of the simulation indicate that overall correlation is unlikely to be used in transcription factor binding site recognition.14 pagesen-USThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.SimulationInformation ContentTranscriptionParallelized Genetic AlgorithmUMBC High Performance Computing Facility (HPCF)Text