Coxsackievirus A9 (CAV9), a member of the Picornaviridae family, uses an RGD motif in the VP1 capsid protein to bind to integrin αvβ6 during cell entry. Here we report that two CAV9 isolates can bind to the heparan sulfate/heparin class of proteoglycans (HSPG). Sequence analysis identified an arginine (R) at position 132 in VP1 in these two isolates, rather than a threonine (T) as seen in the n...

BACKGROUND The study evaluated reliability and outcomes of percutaneous dilatational tracheostomy (PDT) performed via Griggs' method in the intensive care unit. MATERIAL AND METHODS We examined 78 patients who underwent bedside PDT in the intensive care unit (ICU). Demographic characteristics were recorded. In addition, ventilator-related pneumonia, duration of performing PDT, and rates of comp...

The interval number of a graph G is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals, denoted by i (G ). Griggs and West showed that i(G) d12(d þ 1)e. We describe the extremal graphs for that inequality when d is even. For three special perfect graph classes we give bounds on the interval number in terms of the independe...

In this paper, we give an overview of the competition formats and the schedules used in 25 European soccer competitions for the season 2008–2009. We discuss how competitions decide the league champion, qualification for European tournaments, and relegation. Following Griggs and Rosa (Bull. ICA 18:65–68, 1996), we examine the popularity of the so-called canonical schedule. We investigate the pre...

Motivated both by the work of Anstee, Griggs, and Sali on forbidden submatrices and also by the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M contains no submatrix F ∈ F (as a row and column permutation of F ). A matrix M without repeated columns is F-saturated if M is F-admissible but t...

The distance-two labeling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and nonconsecutive integers...

Let Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence under rotation. Griggs, Killian, and Savage proved that Np is a symmetric chain order for prime p. In this paper, we settle the question of whether this poset is a symmetric chain order for all n by providing an algorithm that produces a symmetric chain decompostion (or SCD). We accomplish this by modify...