Sciweavers

6266 search results - page 1219 / 1254
» New results on the computability and complexity of points - ...
Sort
View
BMCBI
2005
94views more  BMCBI 2005»
13 years 7 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel
NAR
1998
229views more  NAR 1998»
13 years 7 months ago
GDB: the Human Genome Database
The Genome Database (GDB, http://www.gdb.org ) is a public repository of data on human genes, clones, STSs, polymorphisms and maps. GDB entries are highly cross-linked to each oth...
Stanley Letovsky, Robert W. Cottingham, Christophe...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 5 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
FAC
2010
121views more  FAC 2010»
13 years 5 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 8 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
« Prev « First page 1219 / 1254 Last » Next »