A parallel simulation of the evolution of transcription factor binding sites

Thumbnail Image

Files

ForderMath627.pdf (333.22 KB)

Links to Files

https://userpages.umbc.edu/~gobbert/papers/ForderMath627.pdf

Permanent Link

http://hdl.handle.net/11603/11746

Collections

UMBC Mathematics and Statistics Department

Author/Creator

Author/Creator ORCID

Date

2011-05-27

Type of Work

technical report
Text

Department

Program

Citation of Original Publication

Rights

This 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.

Subjects

parallel simulation
evolution
transcription factor binding motifs
binding sites
UMBC High Performance Computing Facility (HPCF)

Abstract

The 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 in potential binding sites as a criteria for recognition. We implement a genetic algorithm in parallel using a simple server-client organization to simulate the evolution of these binding sites. We then evaluate the performance of this application and conclude that exhibits excellent speedup and efficiency.