Show simple item record

dc.contributor.advisorArce, Rafael (Mentor)
dc.contributor.authorRodríguez, Joseph Martire
dc.date.accessioned2015-11-21T21:33:23Z
dc.date.available2015-11-21T21:33:23Z
dc.date.issued2013-03-01
dc.identifier.urihttp://hdl.handle.net/123456789/2738
dc.description.abstractRobustness is a fundamental property of biological systems which expresses a system’s ability to maintain function in the face of mutational or environmental challenges.. To measure the robustness of a DNA strand we calculate its energy by subtracting its initial and final state, this is also known as Gibbs Free Energy. On a typical mutational robustness algorithm, there is a great number of operations O(n^2) that must be executed per population. Because the values increment given a bigger number of generation and population, faster implementations are required to run this program. Since computations on population members are data independent, this algorithm is a good candidate for improvement by using the parallelism available in field programmable gate arrays (FPGAs).
dc.description.sponsorshipDepartamento de Ciencias de Cómputos - UPRRP, Universidad Metropolitana, National Science Foundation, Seminario Interuniversitario de Investigación en Ciencias Matemáticas.
dc.language.isoen_US
dc.publisherSeminario Interuniversitario de Investigación en Ciencias Matemáticas (SIDIM)
dc.subjectrobustness
dc.subjectDNA
dc.subjectGibbs Free Energy
dc.subjectmutational robustness algorithm
dc.titlePipelined Algorithm to Calculate Gibb’s Free Energy for Mutational Robustness
dc.typePoster


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record