Sciweavers

46 search results - page 3 / 10
» Solving NP-complete problems in the tile assembly model
Sort
View
IANDC
2008
213views more  IANDC 2008»
13 years 5 months ago
Decision problem for shuffled genes
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...
Ion Petre, Vladimir Rogojin
CGO
2003
IEEE
13 years 11 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 6 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
WSC
2008
13 years 8 months ago
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Weida Xu, Tianyuan Xiao
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
13 years 12 months ago
Solutions to Computational Problems Through Gene Assembly
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
Artiom Alhazov, Ion Petre, Vladimir Rogojin