Sciweavers

3575 search results - page 102 / 715
» Structured motifs search
Sort
View
FOCS
2008
IEEE
16 years 27 days ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CP
2009
Springer
16 years 1 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
16 years 15 days ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
RECOMB
2005
Springer
15 years 12 months ago
Probabilistic in Silico Prediction of Protein-Peptide Interactions
Abstract. Peptide recognition modules (PRMs) are specialised compact protein domains that mediate many important protein-protein interactions. They are responsible for the assembly...
Wolfgang P. Lehrach, Dirk Husmeier, Christopher K....
CSB
2004
IEEE
158views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Algorithms for Association Study Design Using a Generalized Model of Haplotype Conservation
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
Russell Schwartz