—In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the co...
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre
The accurate prediction of enzyme catalytic sites remains an open problem in bioinformatics. Recently, several structure-based methods have become popular; however, few robust seq...
Gene regulatory network model is the most widely used mechanism to model and predict the behavior of living organisms. Network Component Analysis (NCA) as an emerging issue for unc...
Abstract-- The advance of high-throughput experimental technologies poses continuous challenges to computational data analysis in functional and comparative genomics studies. Gene ...
Abstract— We applied Support Vector Machines to the prediction of the subcellular localization of transmembrane proteins, and compared the performance of different sequence kerne...
Stefan Maetschke, Marcus Gallagher, Mikael Bod&eac...
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
Sara Nasser, Gregory Vert, Monica N. Nicolescu, Al...
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...