Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a ...

This paper is motivated by the following problem: given the family ofclique trees of a chordal graph G, determine whether it is also the family of compatible trees of some dually chordal graph H. A relationship isestablished ...

The wavelet tree is a flexible data structure that permits representing sequences S[1, n] of symbols over an alphabet of size sigma, within compressed space and supporting a wide range of operations on S. When sigma is ...

Three different types of data sets, for which the uniquely most parsimonious tree can be known exactly but is hard to find with heuristic tree search methods, are studied. Tree searches are complicated more by the shape ...

Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort ...

Satellite images have a very high resolution, which make their automatic processing computationally costly, and they suffer from artifacts making their processing difficult. This paper describes a method for the effective ...

Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is ...