O problema dos uns consecutivos utilizando arquiteturas reconfiguráveis

AUTOR(ES)
DATA DE PUBLICAÇÃO

2007

RESUMO

Reconfigurable architectures enable the hardware function to be implemented by the user. Due to its characteristics, these architectures have been used in many areas, including Bioinformatics. Many problems in Bioinformatics can be represented by mathematical models that, in turn, can be solved by computational methods. The consecutive ones problems is an example of such problems. Its goal is to find a permutation of columns in a binary matrix, in such a way that all the ones in each row are consecutive. This matrix represents information abou DNA fragments and, thus, assist the determination of the order of the nitrogened bases that form the original DNA. This work describes the concepts of reconfigurable architectures and the main programmable logic devices. The consecutive ones problem and an algorithm to solve it are also revised. It is also presented several implementations, in a reconfigurable hardware, of sections of the algorithm for solving the ones consecutive problem, in order to achieve a better performance in its execution. The results obtained through experiments performed with these implementations are presented and analyzed. Finally, the conclusions of this work are describe and the future work that can expand the presented solutions are shown.

ASSUNTO(S)

ciencia da computacao reconfigurable architectures dna physical mapping mapeamento físico de dna arquiteturas reconfiguráveis consecutive ones problem software/hardware partitioning

ACESSO AO ARTIGO

Documentos Relacionados