Sciweavers

1090 search results - page 91 / 218
» The Equivalence between Biology and Computation
Sort
View
121
Voted
DCC
2011
IEEE
14 years 7 months ago
The cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
Padraig Ó Catháin, Marc Röder
108
Voted
MST
2006
149views more  MST 2006»
15 years 21 days ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
77
Voted
MFCS
2005
Springer
15 years 6 months ago
Canonical Disjoint NP-Pairs of Propositional Proof Systems
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
Christian Glaßer, Alan L. Selman, Liyu Zhang
CBMS
2009
IEEE
15 years 4 months ago
Medical image processing workflow support on the EGEE grid with taverna
Resource-intensive and complex medical imaging applications can benefit from the use of scientific workflow technology for their design, rapid implementation and reuse, but at the...
Ketan Maheshwari, Carole A. Goble, Paolo Missier, ...
129
Voted
SPDP
1991
IEEE
15 years 4 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein