Chemical studies of viral entry mechanisms: I. Hydrophobic protein-lipid interactions during sendai virus membrane fusion. II. Kinetics of bacteriophage λ DNA injection.

Viruses possess very specific methods of targeting and entering cells. These methods would be extremely useful if they could also be applied to drug delivery, but little is known about the molecular mechanisms of the viral entry process. In order to gain further insight into mechanisms of viral entry, chemical and spectroscopic studies in two systems were conducted, examining hydrophobic protein-lipid interactions during Sendai virus membrane fusion, and the kinetics of bacteriophage λ DNA injection.

Sendai virus glycoprotein interactions with target membranes during the early stages of fusion were examined using time-resolved hydrophobic photoaffinity labeling with the lipid-soluble carbene generator3-(trifluoromethyl)-3-(m-^(125 )I] iodophenyl)diazirine (TID). The probe was incorporated in target membranes prior to virus addition and photolysis. During Sendai virus fusion with liposomes composed of cardiolipin (CL) or phosphatidylserine (PS), the viral fusion (F) protein is preferentially labeled at early time points, supporting the hypothesis that hydrophobic interaction of the fusion peptide at the N-terminus of the F_1 subunit with the target membrane is an initiating event in fusion. Correlation of the hydrophobic interactions with independently monitored fusion kinetics further supports this conclusion. Separation of proteins after labeling shows that the F_1 subunit, containing the putative hydrophobic fusion sequence, is exclusively labeled, and that the F_2 subunit does not participate in fusion. Labeling shows temperature and pH dependence consistent with a need for protein conformational mobility and fusion at neutral pH. Higher amounts of labeling during fusion with CL vesicles than during virus-PS vesicle fusion reflects membrane packing regulation of peptide insertion into target membranes. Labeling of the viral hemagglutinin/neuraminidase (HN) at low pH indicates that HN-mediated fusion is triggered by hydrophobic interactions, after titration of acidic amino acids. HN labeling under nonfusogenic conditions reveals that viral binding may involve hydrophobic as well as electrostatic interactions. Controls for diffusional labeling exclude a major contribution from this source. Labeling during reconstituted Sendai virus envelope-liposome fusion shows that functional reconstitution involves protein retention of the ability to undergo hydrophobic interactions.

Examination of Sendai virus fusion with erythrocyte membranes indicates that hydrophobic interactions also trigger fusion between biological membranes, and that HN binding may involve hydrophobic interactions as well. Labeling of the erythrocyte membranes revealed close membrane association of spectrin, which may play a role in regulating membrane fusion. The data show that hydrophobic fusion protein interaction with both artificial and biological membranes is a triggering event in fusion. Correlation of these results with earlier studies of membrane hydration and fusion kinetics provides a more detailed view of the mechanism of fusion.

The kinetics of DNA injection by bacteriophage λ. into liposomes bearing reconstituted receptors were measured using fluorescence spectroscopy. LamB, the bacteriophage receptor, was extracted from bacteria and reconstituted into liposomes by detergent removal dialysis. The DNA binding fluorophore ethidium bromide was encapsulated in the liposomes during dialysis. Enhanced fluorescence of ethidium bromide upon binding to injected DNA was monitored, and showed that injection is a rapid, one-step process. The bimolecular rate law, determined by the method of initial rates, revealed that injection occurs several times faster than indicated by earlier studies employing indirect assays.

It is hoped that these studies will increase the understanding of the mechanisms of virus entry into cells, and to facilitate the development of virus-mimetic drug delivery strategies.

MODIFIED DIRECT TWOS-COMPLEMENT PARALLEL ARRAY MULTIPLICATION ALGORITHM FOR COMPLEX MATRIX OPERATION

A direct twos-complement parallel array multiplication algorithm is introduced and modified for digital optical numerical computation. The modified version overcomes the problems encountered in the conventional optical twos-complement algorithm. In the array, all the summands are generated in parallel, and the relevant summands having the same weights are added simultaneously without carries, resulting in the product expressed in a mixed twos-complement system. In a two-stage array, complex multiplication is possible with using four real subarrays. Furthermore, with a three-stage array architecture, complex matrix operation is straightforwardly accomplished. In the experiment, parallel two-stage array complex multiplication with liquid-crystal panels is demonstrated.

Visual pattern recognition network: Its training algorithm and its optoelectronic architecture

A visual pattern recognition network and its training algorithm are proposed. The network constructed of a one-layer morphology network and a two-layer modified Hamming net. This visual network can implement invariant pattern recognition with respect to image translation and size projection. After supervised learning takes place, the visual network extracts image features and classifies patterns much the same as living beings do. Moreover we set up its optoelectronic architecture for real-time pattern recognition. (C) 1996 Optical Society of America

Two-step digit-set-restricted modified signed-digit addition-subtraction algorithm and its optoelectronic implementation

A novel, to our knowledge, two-step digit-set-restricted modified signed-digit (MSD) addition-subtraction algorithm is proposed. With the introduction of the reference digits, the operand words are mapped into an intermediate carry word with all digits restricted to the set {(1) over bar, 0} and an intermediate sum word with all digits restricted to the set {0, 1}, which can be summed to form the final result without carry generation. The operation can be performed in parallel by use of binary logic. An optical system that utilizes an electron-trapping device is suggested for accomplishing the required binary logic operations. By programming of the illumination of data arrays, any complex logic operations of multiple variables can be realized without additional temporal latency of the intermediate results. This technique has a high space-bandwidth product and signal-to-noise ratio. The main structure can be stacked to construct a compact optoelectronic MSD adder-subtracter. (C) 1999 Optical Society of America.

Parallel optical negabinary signed-digit computing: algorithm and optical implementation

Negabinary is a component of the positional number system. A complete set of negabinary arithmetic operations are presented, including the basic addition/subtraction logic, the two-step carry-free addition/subtraction algorithm based on negabinary signed-digit (NSD) representation, parallel multiplication, and the fast conversion from NSD to the normal negabinary in the carry-look-ahead mode. All the arithmetic operations can be performed with binary logic. By programming the binary reference bits, addition and subtraction can be realized in parallel with the same binary logic functions. This offers a technique to perform space-variant arithmetic-logic functions with space-invariant instructions. Multiplication can be performed in the tree structure and it is simpler than the modified signed-digit (MSD) counterpart. The parallelism of the algorithms is very suitable for optical implementation. Correspondingly, a general-purpose optical logic system using an electron trapping device is suggested. Various complex logic functions can be performed by programming the illumination of the data arrays without additional temporal latency of the intermediate results. The system can be compact. These properties make the proposed negabinary arithmetic-logic system a strong candidate for future applications in digital optical computing with the development of smart pixel arrays. (C) 1999 Society of Photo-Optical Instrumentation Engineers. [S0091-3286(99)00803-X].

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

A reliable phase unwrapping algorithm based on the local fitting plane and quality map

A fast and reliable phase unwrapping (PhU) algorithm, based on the local quality-guided fitting plane, is presented. Its framework depends on the basic plane-approximated assumption for phase values of local pixels and on the phase derivative variance (PDV) quality map. Compared with other existing popular unwrapping algorithms, the proposed algorithm demonstrated improved robustness and immunity to strong noise and high phase variations, given that the plane assumption for local phase is reasonably satisfied. Its effectiveness is demonstrated by computer-simulated and experimental results.

Weighted least-squares phase unwrapping algorithm based on derivative variance correlation map

Among different phase unwrapping approaches, the weighted least-squares minimization methods are gaining attention. In these algorithms, weighting coefficient is generated from a quality map. The intrinsic drawbacks of existing quality maps constrain the application of these algorithms. They often fail to handle wrapped phase data contains error sources, such as phase discontinuities, noise and undersampling. In order to deal with those intractable wrapped phase data, a new weighted least-squares phase unwrapping algorithm based on derivative variance correlation map is proposed. In the algorithm, derivative variance correlation map, a novel quality map, can truly reflect wrapped phase quality, ensuring a more reliable unwrapped result. The definition of the derivative variance correlation map and the principle of the proposed algorithm are present in detail. The performance of the new algorithm has been tested by use of a simulated spherical surface wrapped data and an experimental interferometric synthetic aperture radar (IFSAR) wrapped data. Computer simulation and experimental results have verified that the proposed algorithm can work effectively even when a wrapped phase map contains intractable error sources. (c) 2006 Elsevier GmbH. All rights reserved.

Discussions about FFT-based two-step phase-shifting algorithm

An FFT-based two-step phase-shifting (TPS) algorithm is described in detail and implemented by use of experimental interferograms. This algorithm has been proposed to solve the TPS problem with random phase shift except pi. By comparison with the visibility-function-based TPS algorithm, it proves that the FFT-based algorithm has obvious advantages in phase extracting. Meanwhile, we present a pi-phase-shift supplement to the TPS algorithm, which combines the two interferograms and demodulates the phase map by locating the extrema of the combined fringes after removing the respective backgrounds. So combining this method and FFT-based one, one could really implement the TPS with random phase shift. Whereafter, we systematically compare the TPS with single-interferogram analysis algorithm and conventional three-step phase-shifting one. The results demonstrate that the FFT-based TPS algorithm has a satisfactory accuracy. At last, based on the polarizing interferometry, a schematic setup of two-channel TPS interferometer with random phase shift is suggested to implement the simultaneous collection of interferograms. (c) 2007 Elsevier GrnbH. All rights reserved.