310 search results - page 6 / 62 » Using Parallel Algorithms for Searching Molecular Sequence D... |
BIBE
2007
IEEE
13 years 7 months ago
2007
IEEE
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
GCB
1997
Springer
13 years 11 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
ICDM
2002
IEEE
14 years 14 days ago
2002
IEEE
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
BMCBI
2008
13 years 7 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...