Sciweavers

1284 search results - page 98 / 257
» Data Structures for Mergeable Trees
Sort
View
ISMB
2000
13 years 9 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
ESOP
2004
Springer
14 years 1 months ago
Adaptive Pattern Matching on Binary Data
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
Per Gustafsson, Konstantinos F. Sagonas
DOCENG
2005
ACM
13 years 9 months ago
Integrating translation services within a structured editor
Fully automatic machine translation cannot produce high quality translation; Dialog-Based Machine Translation (DBMT) is the only way to provide authors with a means of translating...
Ali Choumane, Hervé Blanchon, Cécile...