11345 search results - page 2011 / 2269 » Foundations of Computer Science |
125
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
161
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
116
click to vote
DIS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Behavioral sequences of the medaka (Oryzias latipes) were continuously investigated through an automatic image recognition system in response to medaka treated with the i...
136
click to vote
DIS
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, the semantic relationships between a predicate and its arguments in terms of semantic roles are employed to improve lexical-based named entity recognition (NER) in t...
116
click to vote
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...