820 search results - page 15 / 164 » Finding low-utility data structures |
ALMOB
2006
13 years 8 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
CCCG
2010
13 years 10 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
SIGCSE
2004
ACM
14 years 2 months ago
2004
ACM
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
BMCBI
2004
13 years 8 months ago
2004
Background: Computational gene prediction continues to be an important problem, especially for genomes with little experimental data. Results: I introduce the SNAP gene finder whi...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...