621 search results - page 39 / 125 » DNA Computing in Microreactors |
BMCBI
2008
13 years 8 months ago
2008
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
Regulatory sequence elements provide important clues to understanding and predicting gene expression. Although the binding sites for hundreds of transcription factors are known, t...
BMCBI
2007
2007
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
13 years 8 months ago
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
This paper presents the Smith and Waterman Algorithm-Specific ASIC Design (SWASAD) project. This is a hardware solution that implements the S&W algorithm.. The SWASAD is an imp...
TSMC
2008
13 years 8 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...