Sciweavers

2447 search results - page 356 / 490
» Chemical Similarity Searching
Sort
View
ECAI
2010
Springer
15 years 3 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...
COMAD
2009
15 years 3 months ago
Querying for relations from the semi-structured Web
We present a class of web queries whose result is a multi-column relation instead of a collection of unstructured documents as in standard web search. The user specifies the query...
Sunita Sarawagi
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 2 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2006
95views more  BMCBI 2006»
15 years 1 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
BMCBI
2005
106views more  BMCBI 2005»
15 years 1 months ago
A multistep bioinformatic approach detects putative regulatory elements in gene promoters
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
Stefania Bortoluzzi, Alessandro Coppe, Andrea Biso...