The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible.

Abstract We study the problem of designing a resilient data structure maintaining tree under Faulty-RAM model [Finocchi and Italiano, STOC’04] in which up to $$\delta $$ δ memory words can be corrupted by an adversary. Our stores rooted dynamic that updated via addition new leaves, requires linear size, suppo...

A simple and general method for computing location codes of same-size neighboring nodes for any direction within quadtrees is developed and then extended for octrees and 4-D hyperoctrees. The effect of our algorithm is to ascend the tree, guided by navigational cues, until the nearest common ancestor of the target node and the computed neighbor node is reached. An advantage of our algorithm is ...

Many regulatory genes appear to be utilized in at least superficially similar ways in the development of particular body parts in Drosophila and in chordates. These similarities have been widely interpreted as functional homologies, producing the conventional view of the last common protostome-deuterostome ancestor (PDA) as a complex organism that possessed some of the same body parts as modern...

We consider the Moran model in continuous time with two types, mutation, and selection. We concentrate on the ancestral line and its stationary type distribution. Building on work by Fearnhead (J. Appl. Probab. 39 (2002), 38-54) and Taylor (Electron. J. Probab. 12 (2007), 808-847), we characterise this distribution via the fixation probability of the offspring of all individuals of favourable t...

Reconstruction of ancestral genomic features can be considered on multiple evolutionary scopes and at different levels of biological sequence information. For instance, one could anticipate the reconstruction of genomic features for the last common ancestor of all species on Earth, last universal common ancestor or LUCA, whereas others would focus on reconstructing these features in the last co...

Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN , which allo...

Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, the \bottom-up" construction of knowledge bases, learning tasks, and for speciic kinds of information retrieval. So far, computing the leas...

As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA) semantics is one of the most widely accepte...