Sciweavers

19 search results - page 2 / 4
» Simple Gene Assembly Is Deterministic
Sort
View
IANDC
2008
213views more  IANDC 2008»
13 years 6 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
TCS
2011
13 years 1 months ago
Limitations of self-assembly at temperature 1
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
David Doty, Matthew J. Patitz, Scott M. Summers
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 10 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
BIBE
2007
IEEE
108views Bioinformatics» more  BIBE 2007»
14 years 23 days ago
On the Design of Oligos for Gene Synthesis
— Methods for reliable synthesis of long genes offer great promise for protein synthesis via expression of synthetic genes, with applications to improved analysis of protein stru...
Chris Thachuk, Anne Condon
BMCBI
2005
81views more  BMCBI 2005»
13 years 6 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges