906 search results - page 148 / 182 » Matching Subsequences in Trees |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Comprehensive data analysis has become indispensable in a variety of environments. Standard OLAP (On-Line Analytical Processing) systems, designed for satisfying the reporting need...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
IJCAI
1989
13 years 8 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
ALMOB
2006
13 years 7 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...