Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Farzaneh Sadat Tabataba"'
Autor:
Farzaneh Sadat Tabataba, Prithwish Chakraborty, Naren Ramakrishnan, Srinivasan Venkatramanan, Jiangzhuo Chen, Bryan Lewis, Madhav Marathe
Publikováno v:
BMC Infectious Diseases, Vol 17, Iss 1, Pp 1-27 (2017)
Abstract Background Over the past few decades, numerous forecasting methods have been proposed in the field of epidemic forecasting. Such methods can be classified into different categories such as deterministic vs. probabilistic, comparative methods
Externí odkaz:
https://doaj.org/article/f3e923e8efdc4e5690ad6fd635160ced
Autor:
Farzaneh Sadat Tabataba, Foroogh S. Tabataba, Dave Higdon, Madhav V. Marathe, Srinivasan Venkatramanan, Bryan Lewis, Jiangzhuo Chen, Milad Hosseinipour
Publikováno v:
ICDM
Over the past decades, numerous techniques have been developed to forecast the temporal evolution of epidemic outbreaks. This paper proposes an approach that combines high resolution agent-based models using realistic social contact networks for simu
Autor:
Farzaneh Sadat Tabataba, Naren Ramakrishnan, Srinivasan Venkatramanan, Bryan Lewis, Jiangzhuo Chen, Madhav V. Marathe, Prithwish Chakraborty
Publikováno v:
BMC Infectious Diseases
BMC Infectious Diseases, Vol 17, Iss 1, Pp 1-27 (2017)
BMC Infectious Diseases, Vol 17, Iss 1, Pp 1-27 (2017)
Background: Over the past few decades, numerous forecasting methods have been proposed in the field of epidemic forecasting. Such methods can be classified into different categories such as deterministic vs. probabilistic, comparative methods vs. gen
Autor:
Lenwood S. Heath, Yihui Fang, Curtis Klumas, Akshay Kakumanu, Delasa Aghamirzaie, Eva Collakova, Ruth Grene, Elijah Myers, Farzaneh Sadat Tabataba
Publikováno v:
Metabolites
Metabolites; Volume 3; Issue 2; Pages: 347-372
Metabolites, Vol 3, Iss 2, Pp 347-372 (2013)
Metabolites; Volume 3; Issue 2; Pages: 347-372
Metabolites, Vol 3, Iss 2, Pp 347-372 (2013)
Soybean (Glycine max) seeds are an important source of seed storage compounds, including protein, oil, and sugar used for food, feed, chemical, and biofuel production. We assessed detailed temporal transcriptional and metabolic changes in developing
Publikováno v:
Engineering Applications of Artificial Intelligence
The Shortest Common Supersequence Problem asks to obtain a shortest string that is a supersequence of every member of a given set of strings. It has applications, among others, in data compression and oligonucleotide microarray production. The proble
Publikováno v:
Computers & Operations Research. 39:512-520
The Longest Common Subsequence problem seeks a longest subsequence of every member of a given set of strings. It has applications, among others, in data compression, FPGA circuit minimization, and bioinformatics. The problem is NP-hard for more than
Publikováno v:
Computational biology and chemistry. 36
The Longest Common Subsequence Problem is the problem of finding a longest string that is a subsequence of every member of a given set of strings. It has applications in FPGA circuit minimization, data compression, and bioinformatics, among others. T