Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Procedural encoding of scattered and unstructured scalar datasets using Radial Basis Functions (RBF) is an active area of research with great potential for compactly representing ...
Manfred Weiler, Ralf P. Botchen, Simon Stegmaier, ...
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...