111 search results - page 20 / 23 » Fast Algorithm and Implementation of Dissimilarity Self-Orga... |
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
126
click to vote
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...
MVA
2000
14 years 11 months ago
2000
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
BMCBI
2008
14 years 10 months ago
2008
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
112
click to vote
ISMB
1994
14 years 11 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...