Synthetic genetic array (SGA) has been successfully used to identify genetic interactions in S. cerevisiae and S. pombe. In S. pombe, SGA methods use either cycloheximide (C) or heat shock (HS) to select double mutants before measuring colony size as a surrogate for fitness. Quantitative Fitness Analysis (QFA) is a different method for determining fitness of microbial strains. In QFA, liquid cu...

As was shown in [2], totally categorical structures (i.e. which are categorical in all powers) are not finitely axiomatizable. On the other hand, the most simple totally categorical structures: infinite sets, infinite projective or affine geometries over a finite field, are quasi finitely axiomatizable (i.e. axiomatized by a finite number of axioms and the schema of infinity, we will use the ab...

BACKGROUND Accurate and reliable blood grouping is essential for safe blood transfusion. However, conventional methods are qualitative and use only single-antigen detection. We overcame these limitations by developing a simple, quantitative, and multiplexed detection method for blood grouping using quantum dots (QDs) and magnetic beads. METHODS In the QD fluorescence assay (QFA), blood group ...

This paper proposes a new method for signal classification based on combination of deep-learning (DL) image classifiers and recently introduced nonlinear spectral analysis technique called quantile-frequency (QFA). The QFA converts one-dimensional into two-dimensional representation quantile periodograms (QPER) which represent the signal’s oscillatory behavior in frequency domain at different q...

To better understand telomere biology in budding yeast, we have performed systematic suppressor/enhancer analyses on yeast strains containing a point mutation in the essential telomere capping gene CDC13 (cdc13-1) or containing a null mutation in the DNA damage response and telomere capping gene YKU70 (yku70Δ). We performed Quantitative Fitness Analysis (QFA) on thousands of yeast strains conta...

The main purpose of this paper is to show that we can exploit the difference (l1-norm and l2-norm) in the probability calculation between quantum and probabilistic computations to claim the difference in their space efficiencies. It is shown that there is a finite language L which contains sentences of length up to O(n) such that: (i) There is a one-way quantum finite automaton (qfa) of O(n) st...

Multi-letter quantum finite automata (QFAs) were a new one-way QFA model proposed recently by Belovs, Rosmanis, and Smotrovs (LNCS, Vol. 4588, Springer, Berlin, 2007, pp. 60-71), and they showed that multi-letter QFAs can accept with no error some regular languages (a + b)b that are unacceptable by the one-way QFAs. In this paper, we study the decidability of the equivalence of multi-letter QFA...

We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1− ǫ for all ǫ > 0 with O(logn) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2 log n) states.