Results 21 to 30 of about 116,703 (295)
Comparison of four agar media for the enumeration of the Mycobacterium abscessus complex
Background: Traditional culture of nontuberculous mycobacteria (NTMs) has involved egg-based formulations (Lowenstein–Jensen medium) or defined media (Middlebrook formulations), which have disadvantages of composition complexity, availability, and cost ...
John Edmund Moore +1 more
doaj +1 more source
Enumerations including laconic enumerators
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jain, Sanjay, Teutsch, Jason
openaire +1 more source
This study introduces an optimized integration of flow cytometry and fluorescence in situ hybridization (Flow-FISH) as an approach for the specific enumeration of gram-positive bacteria in probiotic products, overcoming the limitations of conventional ...
Laura Snaidr +5 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Eric, Osherson, Daniel
openaire +1 more source
Improvements offered by viability droplet digital PCR (v-ddPCR) include increased precision, specificity and decreased time to results making for an attractive alternative method to traditional plate count enumeration of probiotic products.
Anthony Kiefer +4 more
doaj +1 more source
Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
openaire +2 more sources
Polytropes are both ordinary and tropical polytopes. We show that tropical types of polytropes in $\mathbb{TP}^{n-1}$ are in bijection with cones of a certain Gröbner fan $\mathcal{GF}_n$ in $\mathbb{R}^{n^2 - n}$ restricted to a small cone called the polytrope region.
openaire +3 more sources
Enumeration of dissociation sets in grid graphs
A dissociation set of a graph $ G $ refers to a set of vertices inducing a subgraph with maximum degree at most 1 and serves as a generalization of two fundamental concepts in graph theory: Independent sets and induced matchings.
Wenke Zhou +3 more
doaj +1 more source
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source
We present a series of programs for enumerating the rational numbers without duplication, drawing on some elegant results of Neil Calkin, Herbert Wilf and Moshe Newman.
Gibbons, Jeremy +2 more
openaire +5 more sources

