Sciweavers

DNA
2006
Springer
159views Bioinformatics» more  DNA 2006»
15 years 6 months ago
Minimal Parallelism for Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
Tseren-Onolt Ishdorj
DNA
2006
Springer
15 years 6 months ago
Hairpin Structures Defined by DNA Trajectories
We examine scattered hairpins, which are structures formed when a single strand of nucleotides folds into a partially hybridized stem and a loop. To specify different classes of h...
Michael Domaratzki
DNA
2006
Springer
146views Bioinformatics» more  DNA 2006»
15 years 6 months ago
On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 6 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
DMSN
2006
ACM
15 years 6 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis