Sciweavers

1793 search results - page 17 / 359
» On the Design of Codes for DNA Computing
Sort
View
IJFCS
2007
111views more  IJFCS 2007»
14 years 11 months ago
Involutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over th...
Lila Kari, Kalpana Mahalingam
BMCBI
2010
190views more  BMCBI 2010»
14 years 12 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang
DNA
2007
Springer
159views Bioinformatics» more  DNA 2007»
15 years 6 months ago
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
Urmi Majumder, Thomas H. LaBean, John H. Reif
98
Voted
BMCBI
2007
247views more  BMCBI 2007»
14 years 11 months ago
A survey of DNA motif finding algorithms
Background: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especi...
Modan K. Das, Ho-Kwok Dai
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
15 years 6 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...