Sciweavers

1993 search results - page 399 / 399
» Designing and Building Parallel Program
Sort
View
BMCBI
2011
12 years 8 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
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...
Torbjørn Rognes
ACISP
1997
Springer
13 years 9 months ago
Enabling Technology for the Trading of MPEG-encoded Video
tracts, pp. 11-17. (http://www.qucis.queens.ca/achallc97/papers/p028.html) Alexa, Melina; Rostek, Lothar Pattern Concordances - TATOE calls XGrammar. Presented at ACH -ALLC97, King...
Jana Dittmann, Arnd Steinmetz
BMCBI
2007
151views more  BMCBI 2007»
13 years 5 months ago
A comparison study on algorithms of detecting long forms for short forms in biomedical text
Motivation: With more and more research dedicated to literature mining in the biomedical domain, more and more systems are available for people to choose from when building litera...
Manabu Torii, Zhang-Zhi Hu, Min Song, Cathy H. Wu,...