In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally o...

boophilus genus ticks are responsible for transferring some pathogens and reducing production factors in cattle. tropomysin (tpm) protein has actin regulator activity and playing important role in immune and allergic reactions. the main goal is to determine different aspects of phylogenetic, similarity, homology, structure and allergenicity of tpm protein. in prior study, we identified tpm by u...

Two annotations schemes for presenting the parsed structures are prevalent viz. the constituency structure and the dependency structure. While the constituency trees mark the relations due to positions, the dependency relations mark the semantic dependencies. Free word order languages like Sanskrit pose more problems for constituency parses since the elements within a phrase are dislocated. In ...

The suffix array data structure that we present is due to Grossi and Vitter [1]. It uses a recursive construction that inflates the alphabet size, much like the the suffix array construction that we saw in Lecture 18. Building on this, we will construct a low-space suffix tree by augmenting this suffix array with an additional tree structure. This construction is due to Munro, Raman and Rao [2]...

In this paper, the concept of a fuzzy graph structure is introduced based on the concept of graph structure given by E. Sampathkumar, in Bull. Kerala Math. Assoc., Vol 3, No.2 (2006 December), 65123. New concepts like ρi − edge, ρi − path, ρi − cycle, ρi − tree, ρi − forest, fuzzy ρi − cycle, fuzzy ρi − tree, fuzzy ρi − forest etc. are introduced. Some results are obtained. We continue the stud...

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed in [2]. These regularites admit two different types of behavior and in this work we investigate which of the two types takes place in particular for well-known classes of semigroups. Also we study the question of what kind of chains appear in the tree and cha...

The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring problem (RPC). Here we present a polynomial time algorithm that solves RPC exactly in generalized tree networks of bounded degree. This new topology is of practical interest since it models tree-like backbone networks conn...

A data structure is said to be self-adjusting if it dynamically reorganizes itself to adapt to the pattern of accesses. Efficiency is typically measured in terms of amortized complexity, that is, the average running time of an access over an arbitrary sequence of accesses. The best known example of such a data structure is Sleator and Tarjan’s splay tree. In this paper, we introduce a self-adju...