Search results for "Tree"
showing 10 items of 1841 documents
Identification of a novel VP4 genotype carried by a serotype G5 porcine rotavirus strain
2006
AbstractRotavirus genome segment 4, encoding the spike outer capsid VP4 protein, of a porcine rotavirus (PoRV) strain, 134/04-15, identified in Italy was sequenced, and the predicted amino acid (aa) sequence was compared to those of all known VP4 (P) genotypes. The aa sequence of the full-length VP4 protein of the PoRV strain 134/04-15 showed aa identity values ranging from 59.7% (bovine strain KK3, P8[11]) to 86.09% (porcine strain A46, P[13]) with those of the remaining 25 P genotypes. Moreover, aa sequence analysis of the corresponding VP8* trypsin cleavage fragment revealed that the PoRV strain 134/04-15 shared low identity, ranging from 37.52% (bovine strain 993/83, P[17]) to 73.6% (po…
Street law alla rovescia: sperimentazioni di educazione clinico-legale critica
2021
The "upside-down street law", as I call the educational experiments that I have conducted over the course of several years, intends to challenge the assumption of the vertical monodirectionality of knowledge. How? Creating a more complex field of circulation and production of knowledge, in which the worn-out spatial metaphors of high and low culture, as well as of what is counted inside or outside the legitimate learning space, are questioned. This way of teaching law starts from an analysis of the power relations present in a certain context. And it proposes educational interventions that deconstruct these relationships by reassembling them otherwise. In the article are told some this expe…
Fiber intake and all-cause mortality in the Prevención con Dieta Mediterránea (PREDIMED) study
2014
Background: Few observational studies have examined the effect of dietary fiber intake and fruit and vegetable consumption on total mortality and have reported inconsistent results. All of the studies have been conducted in the general population and typically used only a single assessment of diet. Objective: We investigated the association of fiber intake and whole-grain, fruit, and vegetable consumption with all-cause mortality in a Mediterranean cohort of elderly adults at high cardiovascular disease (CVD) risk by using repeated measurements of dietary information and taking into account the effect of a dietary intervention. Design: We followed up 7216 men (55-75 y old) and women (60-75 …
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…
On the loopless generation of binary tree sequences
1998
Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.
On the listing and random generation of hybrid binary trees
1994
We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Coding Binary Trees by Words over an Alphabet with Four Letters
1992
Abstract We propose a new encoding scheme to represent binary trees with n leaves by words of length n over an alphabet with four letters. We give a characterization of these codewords.
Root-restricted Kleenean rotations
2010
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.
Generation of Valid Labeled Binary Trees
2003
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.