We previously showed that the cell-permeant antioxidant 2(3)- tert-butyl-4-hydroxyanisole (BHA) inhibited germinal vesicle breakdown (GVBD) in oocyte-cumulus complexes (OCC) of the rat. The objective of the present studies was to assess other antioxidants and whether such inhibition was reversible. Spontaneous GVBD in OCC incubated for 2 h was significantly inhibited ( P < 0.005) by nordihydrog...

The polypeptide and structural gene for a high-molecular-mass c-type cytochrome, cytochrome c553O, was isolated from the methanotroph Methylococcus capsulatus Bath. Cytochrome c553O is a homodimer with a subunit molecular mass of 124,350 Da and an isoelectric point of 6. 0. The heme c concentration was estimated to be 8.2 +/- 0.4 mol of heme c per subunit. The electron paramagnetic resonance sp...

The dictionary matching with gaps problem is to preprocess a dictionary D of d gapped patterns P1, . . . , Pd over alphabet Σ, where each gapped pattern Pi is a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text T of length n over alphabet Σ, the goal is to output all locations in T in which a pattern Pi ∈ D, 1 ≤ i ≤ d, ends. There is a renewed curre...

In this paper we present different solutions for the problem of indexing a dictionary of strings in compressed space. Given a pattern P , the index has to report all the strings in the dictionary having edit distance at most one with P . Our first solution is able to solve queries in (almost optimal) O(|P |+ occ) time where occ is the number of strings in the dictionary having edit distance at ...

We consider a sliding window W over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window based on a suffix tree. The data structure of size Θ(|W |) has optimal time queries Θ(m + occ) and amortized consta...

In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up...

Let T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is ...

This paper presents a new multilevel one-cycle control (OCC) technique for five-level diode-clamped converter (DCMC)-based static VAR compensator (STATCOM). The OCC algorithm in combination with multi-carrier level-shifted PWM is used the proposed DCMC-based STATCOM. automatic dc link voltage balance simply realized by four compensators presented as part of controller. In this principle two-lev...