Sciweavers

400 search results - page 63 / 80
» Derandomization and Distinguishing Complexity
Sort
View
AI
2010
Springer
15 years 2 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
BMCBI
2010
86views more  BMCBI 2010»
15 years 2 months ago
ICC-CLASS: isotopically-coded cleavable crosslinking analysis software suite
Background: Successful application of crosslinking combined with mass spectrometry for studying proteins and protein complexes requires specifically-designed crosslinking reagents...
Evgeniy V. Petrotchenko, Christoph H. Borchers
BMCBI
2010
101views more  BMCBI 2010»
15 years 2 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 2 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
BMCBI
2006
216views more  BMCBI 2006»
15 years 1 months ago
Machine learning approaches to supporting the identification of photoreceptor-enriched genes based on expression data
Background: Retinal photoreceptors are highly specialised cells, which detect light and are central to mammalian vision. Many retinal diseases occur as a result of inherited dysfu...
Haiying Wang, Huiru Zheng, David Simpson, Francisc...