Sciweavers

497 search results - page 21 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
RECOMB
2005
Springer
14 years 8 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
BIB
2010
140views more  BIB 2010»
13 years 5 months ago
Next generation sequencing in functional genomics
Genome-wide sequencing has enabled modern biomedical research to relate more and more events in healthy as well as disease-affected cells and tissues to the genomic sequence. Now ...
Thomas Werner
CIE
2009
Springer
14 years 2 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
LICS
2010
IEEE
13 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
BMCBI
2007
168views more  BMCBI 2007»
13 years 7 months ago
GOSim - an R-package for computation of information theoretic GO similarities between terms and gene products
Background: With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the...
Holger Fröhlich, Nora Speer, Annemarie Poustk...