Search results for "Chorda"
showing 10 items of 143 documents
A urochordate putative homolog of human EB1, the protein which binds APC1
1996
Abstract The human EB1 protein has been cloned by virtue of its interaction with the C-terminus of the APC (adenomatous polyposis coli) protein, whose C-terminal truncated forms have been shown to accompany sporadic and familial forms of colorectal cancer. We have cloned a putative EB1 homolog from Botryllus schlosseri (Urochordata, Ascidiacea). The deduced protein is 287 amino acids long, and is identical with 48% of the residues in human EB1 and 24–25% in two yeast hypothetical proteins. We propose that such a high degree of conservation among EB1 homologs is indicative of an essential regulatory mechanism in eukaryotic cells.
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
On the chromatic number of disk graphs
1998
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.
A novel tunicate (Botryllus schlosseri) putative C-type lectin features an immunoglobulin domain.
1997
We have cloned a putative C-type lectin of Botryllus schlosseri [Ascidiacea], whose deduced protein of 333 amino acids features three building blocks: (i) a Greek-key motif signature at the amino-terminus, (ii) a C-type lectin domain signature, and (iii) an immunoglobulin (Ig) domain at the carboxyl terminus. This C-type lectin was termed BSCLT. Similarity searches revealed that the Ig domain in BSCLT, which is evidently not polymorphic, is best classified as an Intermediate-type Ig domain. Rabbit antibodies, raised against recombinant BSCLT, cross-reacted in a Western blot with a 38-kD polypeptide in tunicate crude extract. Presumably, this bimodal tunicate protein is the first description…
Reflexiones sobre cómo evaluar y mejorar la respuesta a la pandemia de COVID-19
2020
La pandemia de COVID-19 ha afectado de manera particularmente intensa a España, pese a su nivel de desarrollo y la elogiada solidez de su Sistema Nacional de Salud. Para comprender qué ha pasado e identificar cómo mejorar la respuesta creemos imprescindible una evaluación independiente multidisciplinaria de la esfera sanitaria, política y socioeconómica. En este trabajo proponemos objetivos, principios, metodología y dimensiones a evaluar, además de esbozar el tipo de resultados y conclusiones esperadas. Nos inspiramos en los requerimientos formulados por el panel independiente de la Organización Mundial de la Salud y en las experiencias evaluativas en otros países, y detallamos la propuest…
On Sturmian Graphs
2007
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.
Some properties of vertex-oblique graphs
2016
The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…
On Coloring Unit Disk Graphs
1998
In this paper the coloring problem for unit disk (UD) graphs is considered. UD graphs are the intersection graphs of equal-sized disks in the plane. Colorings of UD graphs arise in the study of channel assignment problems in broadcast networks. Improving on a result of Clark et al. [2] it is shown that the coloring problem for UD graphs remains NP-complete for any fixed number of colors k≥ 3 . Furthermore, a new 3-approximation algorithm for the problem is presented which is based on network flow and matching techniques.
On the hardness of optimization in power-law graphs
2008
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…