14699 search results - page 2908 / 2940 » Complexity and Cognitive Computing |
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
BMCBI
2005
13 years 7 months ago
2005
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
BMCBI
2005
13 years 7 months ago
2005
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
BMCBI
2005
13 years 7 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
BMCBI
2005
13 years 7 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...