200 search results - page 27 / 40 » On Optimizing Distance-Based Similarity Search for Biologica... |
BMCBI
2002
13 years 7 months ago
2002
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
BMCBI
2006
13 years 8 months ago
2006
Background: Recent, rapid growth in the quantity of available genomic data has generated many protein sequences that are not yet biochemically classified. Thus, the prediction of ...
CIAC
2000
Springer
14 years 7 days ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
RECOMB
1998
Springer
14 years 3 days ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...