Computing the least common subsumer (lcs) yields a generalization of a collection of concepts, computing such generalizations is a useful reasoning task for many ontology-based applications. Since the lcs need not exist, if computed w.r.t. general TBoxes, an approximative approach, the role-depth bounded lcs, has been proposed. Recently, this approach has been extended to the Description logic ...

In the Range Minimum Query (RMQ) problem, we are given an array A of n numbers and we are asked to answer queries of the following type: for indices i and j between 0 and n− 1, query RMQ A (i, j) returns the index of a minimum element in the subarray A[i . . j]. Answering a small batch of RMQs is a core computational task in many realworld applications, in particular due to the connection with ...

It is well known that some XML elements correspond to objects (in the sense of object-orientation) and others do not. The question we consider in this paper is what benefits we can derive from paying attention to such object semantics, particularly for the problem of keyword queries. Keyword queries against XML data have been studied extensively in recent years, with several lowest-common-ances...

We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time such that subsequent LSCA-queries can be answered in constant time. The size is linear in the number of nodes. We also consider a “fuzzy” variant of LSCA that allows to compute a node that is only an LSCA of a given perc...

This study was conducted to investigate the susceptibility of 4 strains (AKR, CF#l, C3H/He and KK) of inbred mice to infection with Schistosoma japonicum. The worm recovery was highest in KK strain (50%), followed by C3H/He (42%) , AKR (42%) and CF #1(38 %) respectively. The worm burden of the females of strain KK was significantly higher than that of the males. The worm maturity was highest in...

A k-repeat is a stringwk=u∗ kv that matches more than one substring of x, where ∗ is the don’t care letter and k > 0.We propose an O(n log n)-time algorithm for computing all longest k-repeats in a given string x = x[1..n]. The proposed algorithm uses suffix trees to fulfill this task and relies on the ability to answer lowest common ancestor queries in constant time. © 2006 Elsevier B.V. All r...

We present in this paper novel techniques that determine the semantic relationships among genes and gene products. We implemented these techniques in a middleware system called GOtoGene, which resides between user application and Gene Ontology database. Given a set S of genes, GOtoGene would return another set S  of genes, where each gene in S  is semantically related to each gene in S . The ...