415 search results - page 74 / 83 » Optimal query complexity bounds for finding graphs |
BMCBI
2005
13 years 7 months ago
2005
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
BIOCOMP
2009
2009
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
13 years 8 months ago
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...