2017 27th International Conference on Field Programmable Logic and Applications (FPL) 2017
DOI: 10.23919/fpl.2017.8056778
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated analysis of Boolean gene regulatory networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0
3

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 21 publications
0
5
0
3
Order By: Relevance
“…Já nas abordagens propostas com FPGA, o maior gargaloé o tempo de compilação e a complexidade do projeto queé específico para cada rede [Purandare et al 2017, Pournara et al 2005, da Silva et al 2017.…”
Section: Trabalhos Relacionadosunclassified
See 2 more Smart Citations
“…Já nas abordagens propostas com FPGA, o maior gargaloé o tempo de compilação e a complexidade do projeto queé específico para cada rede [Purandare et al 2017, Pournara et al 2005, da Silva et al 2017.…”
Section: Trabalhos Relacionadosunclassified
“…Este trabalho difere dos anteriores ao explorar três arquiteturas para implementação da operação básica, o cálculo do próximo estado. Trabalhos futuros poderão avaliar o desempenho para execução de algoritmos que envolverão a evolução dos estados [Purandare et al 2017, da Silva et al 2017, Trinh et al 2014, Borelli et al 2013.…”
Section: Trabalhos Relacionadosunclassified
See 1 more Smart Citation
“…A particular challenge is simulating the dynamics of Gene Regulatory Networks (GRNs), which could be used for a variety of pathological settings, including genetic tumor syndromes, cancer, and obesity. Previous works propose specific FPGA accelerators to speed up GRN computations in addition to traditional CPUs. We have chosen this case study in particular because it allows us to present three different aspects of the ADD framework.…”
Section: Performance Metrics and Analysismentioning
confidence: 99%
“…By performing slight modifications, the proposed method can be used to simulate arbitrary Boolean networks, which opens many interesting perspectives. While there are several works on FPGA simulation of Boolean networks, e.g., [27,28,29], our article differs from them by highlighting the theoretical link between the model of Boolean networks and sequential switching circuits, hence implementing the corresponding simulation in most efficient way.…”
Section: Introductionmentioning
confidence: 96%