Results 81 to 90 of about 245,617 (365)

Induction by Enumeration

open access: yesInformation and Computation, 2001
AbstractInduction by enumeration has a clear interpretation within the numerical paradigm of inductive discovery (i.e., the one pioneered by E. M. Gold (1967, Inform. and Control10, 447–474)). The concept is less easily interpreted within the first-order paradigm discussed by K. T. Kelly (1996, “The Logic of Reliable Inquiry,” Oxford Univ.
Eric Martin, Daniel N. Osherson
openaire   +1 more source

A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
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

Elucidation of interface interactions between a dehydratase domain and an acyl carrier protein in cremimycin polyketide synthase

open access: yesFEBS Letters, EarlyView.
In modular polyketide synthases, the dehydratase (DH) domain catalyzes the dehydration reaction of the β‐hydroxyacyl unit attached to the cognate acyl carrier protein (ACP) domain. However, it is unclear how DH interacts with ACP during the reaction. In this study, we identified DH–ACP interface residues, providing the first detailed insights into DH ...
Kaede Kotagiri   +8 more
wiley   +1 more source

Determinants of tridiagonal matrices over some commutative finite chain rings

open access: yesSpecial Matrices
Diagonal matrices and their generalization in terms of tridiagonal matrices have been of interest due to their nice algebraic properties and wide applications.
Jitman Somphong, Sricharoen Yosita
doaj   +1 more source

Methods currently applied to study the prevalence of Clostridioides difficile in foods

open access: yesAIMS Agriculture and Food, 2020
Clostridioides difficile is responsible for most cases of antibiotic- and hospital-associated diarrhoea. Several studies have demonstrated the presence of C.
Joana Barbosa   +2 more
doaj   +1 more source

A Comparative Study of Enumeration Techniques for Free-Roaming Dogs in Rural Baramati, District Pune, India

open access: yesFrontiers in Veterinary Science, 2018
The presence of unvaccinated free-roaming dogs (FRD) amidst human settlements is a major contributor to the high incidence of rabies in countries such as India, where the disease is endemic.
Harish Kumar Tiwari   +8 more
doaj   +1 more source

A simple formula for bipartite and quasi-bipartite maps with boundaries [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear.
Gwendal Collet, Eric Fusy
doaj   +1 more source

Functional variation among LPMOs revealed by the inhibitory effects of cyanide and buffer ions

open access: yesFEBS Letters, EarlyView.
This study addresses the inhibition of lytic polysaccharide monooxygenases (LPMOs) by cyanide and explains how and why the magnitude of observed inhibitory effects depends on the way LPMO reactions are setup and on the type of LPMO. Enzymes known as lytic polysaccharide monooxygenases (LPMOs) are mono‐copper polysaccharide‐degrading peroxygenases that ...
Ole Golten   +10 more
wiley   +1 more source

Enumeration of Planar Constellations

open access: yesAdvances in Applied Mathematics, 2000
The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let $n\ge 1$, $m \ge 2$, and let $\si_0$ be a permutation of $\Sn_n$ having $d_i$ cycles of length $i$, for $i \ge 1$. We prove that the number of $m$-tuples $(\si_1, \ldots ,\si_m)$ of permutatinos of $\Sn_n$ such that:
Bousquet-Melou, Mireille   +1 more
openaire   +5 more sources

Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases

open access: yesJournal of Applied Computer Science & Mathematics, 2016
Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj   +1 more source

Home - About - Disclaimer - Privacy