310 search results - page 4 / 62 » Using Parallel Algorithms for Searching Molecular Sequence D... |
77
Voted
BMCBI
2006
14 years 10 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
130
Voted
BMCBI
2011
14 years 1 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
106
Voted
CF
2007
ACM
15 years 2 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
VISUALIZATION
1995
IEEE
15 years 1 months ago
1995
IEEE
Biological sequence similarity analysis presents visualization challenges, primarily because of the massive amounts of discrete, multi-dimensional data. Genomic data generated by ...