Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP -complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP -complete or polynomial time solvable), such dichotomy is not necessarily expected for tri...

We describe a new data structure, the Skip B-Tree, that combines the advantages of skip graphs with features of traditional Btrees. A skip B-Tree provides efficient search, insertion and deletion operations. The data structure is highly fault tolerant even to adversarial failures, and allows for particularly simple repair mechanisms. Related resource keys are kept in blocks near each other enab...

This study investigated the influence of ZnO nanostructures on dye adsorption to increase the photovoltaic conversion efficiency of solar cells. ZnO nanostructures were grown in both tree-like and nanorod (NR) arrays on an AZO/FTO film structure by using a hydrothermal method. The results were observed in detail using X-ray diffraction, field-emission scanning electron microscopy (FE-SEM), UV-v...

Krüppel-like factors (KLFs) are a family of zinc finger transcription factors regulating embryonic development and diseases. The phylogenetics of KLFs has not been studied in tree shrews, an animal lineage with a closer relationship to primates than rodents. Here, we identified 17 KLFs from Chinese tree shrew (Tupaia belangeri chinensis). KLF proteins are highly conserved among humans, monkeys,...

We propose a methodological framework for the classification of the tree-like structures of the ductal network of human breast regarding radiological findings related to breast cancer. Initially we perform the necessary preprocessing steps such as image segmentation in order to isolate the ductal tree structure from the background of x-ray galactograms. Afterwards, we employ tree characterizati...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO(<,+1,∼) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the descendant and following sibling relations. Moreover, ∼ is a binary predicate testing data equality. We exh...

Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by ‘simple’ cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.

In this paper, the optical properties of one dimensional fractal structures are investigated. We consider six typical fractal photonic structures: the symmetric dual cantor-like fractal structure, the asymmetric dual cantor-like fractal structure, the single cantor-like fractal structure, the symmetric dual golden-section fractal structure, the asymmetric dual golden-section fractal structure a...