310 search results - page 32 / 62 » Using Parallel Algorithms for Searching Molecular Sequence D... |
134
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: Direct synthesis of genes is rapidly becoming the most efficient way to make functional genetic constructs and enables applications such as codon optimization, RNAi re...
114
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
128
click to vote
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
146
click to vote
GCB
2004
Springer
15 years 6 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
107
click to vote
APBC
2004
15 years 3 months ago
2004
With the continued growth of three dimensional structural information databases comes a corresponding increase in interest in this data for the study of new sequences and an ever-...