PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “binary vectorization”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25Linked to original sources

Construction of high-complexity combinatorial phage display peptide libraries.

Random peptide libraries displayed on the surface of filamentous bacteriophage are widely used as tools for the discovery of ligands for biologically relevant macromolecules, including antibodies, enzymes, and cell surface receptors. Phage display results in linkage of an affinity-selectable function (the displayed peptide) to the DNA encoding that function, allowing selection of individual binding clones by iterative cycles of in vitro panning and in vivo amplification. Critical to the success of a panning experiment is the complexity of the library: the greater the diversity of clones within the library, the more likely the library contains sequences that will bind a given target with useful affinity. A method for construction of high-complexity (> or = 10(9) independent clones) random peptide libraries is presented. The key steps are highly efficient binary ligation under conditions where the vector is relatively dilute, with only a modest molar excess of insert, followed by efficient electrotransformation into Escherichia coli. Library design strategies and a protocol for rapid sequence characterization are also presented.

Amino Acid Sequence↗

Combinatorial QSAR of ambergris fragrance compounds.

A combinatorial quantitative structure-activity relationships (Combi-QSAR) approach has been developed and applied to a data set of 98 ambergris fragrance compounds with complex stereochemistry. The Combi-QSAR approach explores all possible combinations of different independent descriptor collections and various individual correlation methods to obtain statistically significant models with high internal (for the training set) and external (for the test set) accuracy. Seven different descriptor collections were generated with commercially available MOE, CoMFA, CoMMA, Dragon, VolSurf, and MolconnZ programs; we also included chirality topological descriptors recently developed in our laboratory (Golbraikh, A.; Bonchev, D.; Tropsha, A. J. Chem. Inf. Comput. Sci. 2001, 41, 147-158). CoMMA descriptors were used in combination with MOE descriptors. MolconnZ descriptors were used in combination with chirality descriptors. Each descriptor collection was combined individually with four correlation methods, including k-nearest neighbors (kNN) classification, Support Vector Machines (SVM), decision trees, and binary QSAR, giving rise to 28 different types of QSAR models. Multiple diverse and representative training and test sets were generated by the divisions of the original data set in two. Each model with high values of leave-one-out cross-validated correct classification rate for the training set was subjected to extensive internal and external validation to avoid overfitting and achieve reliable predictive power. Two validation techniques were employed, i.e., the randomization of the target property (in this case, odor intensity) also known as the Y-randomization test and the assessment of external prediction accuracy using test sets. We demonstrate that not every combination of the data modeling technique and the descriptor collection yields a validated and predictive QSAR model. kNN classification in combination with CoMFA descriptors was found to be the best QSAR approach overall since predictive models with correct classification rates for both training and test sets of 0.7 and higher were obtained for all divisions of the ambergris data set into the training and test sets. Many predictive QSAR models were also found using a combination of kNN classification method with other collections of descriptors. The combinatorial QSAR affords automation, computational efficiency, and higher probability of identifying significant QSAR models for experimental data sets than the traditional approaches that rely on a single QSAR method.

Algorithms↗

[New method of verification of the position of target points in stereotactic radiosurgery by linear accelerator].

A method for quantitatively checking the position to be used for stereotactic radiosurgery was devised using a digital reconstruction radiogram (DRR) and electric portal images (EPI). On each image, the radiation field and head contour were extracted by binary-coded processing. The center of gravity position vector of the extracted image was calculated, and the vector from the head contour to the radiation field was obtained. By comparing the difference in DRR and EPI, an index was made of positional error. The error in the center of gravity position coordinate in changing 40~80 of 256 image tones in the binary operation was 0.5mm or less. The effect on the center of gravity position vector caused by the image distortion of EPI was within 0.5mm in the 200x200mm(2) region. Statistical processing was carried out on this index value, and a 95% confidence interval was estimated. The index value of the Z component of the lateral image became -1.43+/-0.66, and it shifted to the negative side. Error was evaluated by the verification method devised for the target point position. Results indicate the usefulness of the verification method using center of gravity for the target point position.

Humans↗

Comparison of ranking methods for virtual screening in lead-discovery programs.

This paper discusses the use of several rank-based virtual screening methods for prioritizing compounds in lead-discovery programs, given a training set for which both structural and bioactivity data are available. Structures from the NCI AIDS data set and from the Syngenta corporate database were represented by two types of fragment bit-string and by sets of high-level molecular features. These representations were processed using binary kernel discrimination, similarity searching, substructural analysis, support vector machine, and trend vector analysis, with the effectiveness of the methods being judged by the extent to which active test set molecules were clustered toward the top of the resultant rankings. The binary kernel discrimination approach yielded consistently superior rankings and would appear to have considerable potential for chemical screening applications.

Journal Article↗

Robustness of the latent variable model for correlated binary data.

The marginal regression model offers a useful alternative to conditional approaches to analyzing binary data (Liang, Zeger, and Qaqish, 1992, Journal of the Royal Statistical Society, Series B 54, 3-40). Instead of modelling the binary data directly as do Liang and Zeger (1986, Biometrika 73, 13-22), the parametric marginal regression model developed by Qu et al. (1992, Biometrics 48, 1095-1102) assumes that there is an underlying multivariate normal vector that gives rise to the observed correlated binary outcomes. Although this parametric approach provides a flexible way to model different within-cluster correlation structures and does not restrict the parameter space, it is of interest to know how robust the parameter estimates are with respect to choices of the latent distribution. We first extend the latent modelling to include multivariate t-distributed latent vectors and assess the robustness in this class of distributions. Then we show through a simulation that the parameter estimates are robust with respect to the latent distribution even if latent distribution is skewed. In addtion to this empirical evidence for robustness, we show through the iterative algorithm that the robustness of the regression coefficents with respect to misspecifications of covariance structure in Liang and Zeger's model in fact indicates robustness with respect to underlying distributional assumptions of the latent vector in the latent variable model.

Algorithms↗

Global, local, and graphical person-fit analysis using person-response functions.

Person-fit statistics test whether the likelihood of a respondent's complete vector of item scores on a test is low given the hypothesized item response theory model. This binary information may be insufficient for diagnosing the cause of a misfitting item-score vector. The authors propose a comprehensive methodology for person-fit analysis in the context of nonparametric item response theory. The methodology (a) includes H. Van der Flier's (1982) global person-fit statistic U3 to make the binary decision about fit or misfit of a person's item-score vector, (b) uses kernel smoothing (J. O. Ramsay, 1991) to estimate the person-response function for the misfitting item-score vectors, and (c) evaluates unexpected trends in the person-response function using a new local person-fit statistic (W. H. M. Emons, 2003). An empirical data example shows how to use the methodology for practical person-fit analysis.

Humans↗

Automatic detection of unstained viable cells in bright field images using a support vector machine with an improved training procedure.

Detection of unstained viable cells in bright field images is an inherently difficult task due to the immense variability of cell appearance. Traditionally, it has required human observers. However, in high-throughput robotic systems, an automatic procedure is essential. In this paper, we formulate viable cell detection as a supervised, binary pattern recognition problem and show that a support vector machine (SVM) with an improved training algorithm provides highly effective cell identification. In the case of cell detection, the binary classification problem generates two classes, one of which is much larger than the other. In addition, the total number of samples is extremely large. This combination represents a difficult problem for SVMs. We solved this problem with an iterative training procedure ("Compensatory Iterative Sample Selection", CISS). This procedure, which was systematically studied under various class size ratios and overlap conditions, was found to outperform several commonly used methods, primarily owing to its ability to choose the most representative samples for the decision boundary. Its speed and accuracy are sufficient for use in a practical system.

Algorithms↗

Development and characterization of a generalized gene tagging system for higher plants using an engineered maize transposon Ac.

This report describes a series of transposon tagging vectors for dicotyledonous plants based on the maize transposable element Ac. This binary system includes the transposase (Ts) and the tagging element (Ds) on separate T-DNA vectors. Ts elements include versions in which transcription is driven either by the endogenous Ac promoter or by the cauliflower mosaic virus (CaMV) 35S promoter. Ds tagging element includes a gene conferring methotrexate (Mtx) resistance for selection and a supF gene to facilitate cloning of tagged sequences. The Ds element is flanked by a CaMV 35S promoter and the beta-glucuronidase (GUS) coding sequence so that GUS expression occurs upon excision of the element. We have transformed these Ts and Ds elements into tobacco and demonstrated that the Ts is functional with either promoter, and that the artificial Ds elements are capable of transposition. The amount of excision was found to depend upon both the individual Ts and Ds primary transformants used. Somatic excision of Ds was seen in up to 100% of progeny seedlings containing Ts and Ds. Germinal excision was detected in up to 48% of the progeny of plants containing both elements. Hence, this system can generate a sufficient number of events to be useful in gene tagging.

Base Sequence↗

A tree-based model for homogeneous groupings of multinomials.

The motivation of this paper is to provide a tree-based method for grouping multinomial data according to their classification probability vectors. We produce an initial tree by binary recursive partitioning whereby multinomials are successively split into two subsets and the splits are determined by maximizing the likelihood function. If the number of multinomials k is too large, we propose to order the multinomials, and then build the initial tree based on a dramatically smaller number k-1 of possible splits. The tree is then pruned from the bottom up. The pruning process involves a sequence of hypothesis tests of a single homogeneous group against the alternative that there are two distinct, internally homogeneous groups. As pruning criteria, the Bayesian information criterion and the Wilcoxon rank-sum test are proposed. The tree-based model is illustrated on genetic sequence data. Homogeneous groupings of genetic sequences present new opportunities to understand and align these sequences.

Animals↗

Generation of marker-free transgenic maize by regular two-border Agrobacterium transformation vectors.

By introducing additional T-DNA borders into a binary plasmid used in Agrobacterium-mediated plant transformation, previous studies have demonstrated that the marker gene and the gene of interest (GOI) can be carried by independent T-strands, which sometimes integrate in unlinked loci in the plant genome. This allows the recovery of marker-free transgenic plants through genetic segregation in the next generation. In this study, we have found that by repositioning the selectable marker gene in the backbone and leaving only the GOI in the T-DNA region, a regular two-border binary plasmid was able to generate marker-free transgenic maize plants more efficiently than a conventional single binary plasmid with multiple T-DNA borders. These results also provide evidence that both the right and left borders can initiate and terminate T-strands. Such non-canonical initiation and termination of T-strands may be the basis for the elevated frequencies of cotransformation and unlinked insertions.

Agrobacterium tumefaciens↗

A neural network model analysis to identify victims of intimate partner violence.

The objective of this study was to determine if a neural network model can identify victims of intimate partner violence (IPV). A custom neural network model was constructed and trained using the 1995 ED databases at Truman Medical Center of all female visits. The input vector developed was an array of 100 binary elements containing, in coded form, the patient's age, day of week, primary diagnosis (excluding 995.81), disposition, race, time, and E-code. The trained network was then presented with a series of 19,830 female patients from the 1996 ED database to determine if it could discriminate cases from control subjects. The neural network identified 231 of 297 known IPV victims (sensitivity 78%) in the 1996 database. It also categorized 2234 false-positive patients out of 19,533 IPV-negative patients (specificity 89%). A computer-based neural network model, when supplied with information commonly available in the ED medical record, can identify victims of IPV.

Case-Control Studies↗

Identification of humans using gait.

We propose a view-based approach to recognize humans from their gait. Two different image features have been considered: the width of the outer contour of the binarized silhouette of the walking person and the entire binary silhouette itself. To obtain the observation vector from the image features, we employ two different methods. In the first method, referred to as the indirect approach, the high-dimensional image feature is transformed to a lower dimensional space by generating what we call the frame to exemplar (FED) distance. The FED vector captures both structural and dynamic traits of each individual. For compact and effective gait representation and recognition, the gait information in the FED vector sequences is captured in a hidden Markov model (HMM). In the second method, referred to as the direct approach, we work with the feature vector directly (as opposed to computing the FED) and train an HMM. We estimate the HMM parameters (specifically the observation probability B) based on the distance between the exemplars and the image features. In this way, we avoid learning high-dimensional probability density functions. The statistical nature of the HMM lends overall robustness to representation and recognition. The performance of the methods is illustrated using several databases.

Algorithms↗

Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomography.

Estimating the normal vector field on the boundary of discrete three-dimensional objects is essential for rendering and image measurement problems. Most of the existing algorithms do not provide an accurate determination of the normal vector field for shapes that present edges. Here, we propose a new and simple computational method in order to obtain accurate results on all types of shapes, whatever their local convexity degree. The presented method is based on the gradient vector field analysis of the object distance map. This vector field is adaptively filtered around each surface voxel using angle and symmetry criteria so that as many relevant contributions as possible are accounted for. This optimizes the smoothing of digitization effects while preserving relevant details of the processed numerical object. Thanks to the precise normal field obtained, a projection method can be proposed to immediately derive the surface area from a raw discrete object. An empirical justification of the validity of such an algorithm in the continuous limit is also provided. Some results on simulated data and snow images from X-ray tomography are presented, compared to the Marching Cubes and Convex Hull results, and discussed.

Algorithms↗

Conditional expression in the malaria mosquito Anopheles stephensi with Tet-On and Tet-Off systems.

We report successful conditional gene expression in the malaria vector, Anopheles stephensi, on the basis of binary systems consisting of gene driver and responder transgenic lines generated by Minos-mediated germline transformation. An A. gambiae tissue-specific enhancer derived from a serpin (SRPN10) gene was utilized to control the temporal and spatial expression of doxycycline (dox)-sensitive transcriptional regulators in the driver lines. The "Tet-Off" driver utilized the tetracycline-controlled transcriptional activator (tTA) that is unable to bind and activate transcription from tetracycline operators (TetO) in the presence of dox; the "Tet-on" driver utilized the reverse tTA (rtTA) that, conversely, binds and activates TetO operators in the presence of dox. The responder lines carried insertions encompassing a LacZ reporter gene, cis-regulated by a TetO-P-element hybrid promoter. The progeny of crosses between driver and responder lines expressed beta-galactosidase under dual, tissue-specific and dox-mediated regulation. In adult rtTA/TetOPlacZ progeny, dox treatment rapidly induced beta-galactosidase activity throughout the midgut epithelium and especially in malaria parasite-invaded epithelial cells. Transactivator-dependent, dox-mediated regulation was observed in hemocytes and pericardial cells using both systems. Conditional tissue-specific regulation is a powerful tool for analyzing gene function in mosquitoes and potentially for development of strategies to control disease transmission.

Animals↗

What's related? Generalizing approaches to related articles in medicine.

INTRODUCTION: We did formative evaluations of several variations to the computation of related articles for non-bibliographic resources in the medical domain. METHODS: A binary model and several variations of the vector space model were used to measure similarity between documents. Two corpora were studied, using a human expert as the gold standard. RESULTS: Variations in term weights and stopword choices made little difference to performance. Performance was worse when documents were characterized by title words alone or by MeSH terms extracted from document references. DISCUSSION: Further studies are needed to evaluate these methods in medical information retrieval systems.

Algorithms↗

Learning processes in multilayer threshold nets.

An algorithm of learning in multilayer threshold nets without feedbacks is proposed. The net is built of threshold elements with binary inputs. During a learning process each input vector chi is accompanied by a teacher's decision omega (omega epsilon(1,...,M)). The pairs (chi[n], omega[n]) appear in successive steps independently according to some unknown stationary distribution p(chi, omega). The problem of learning of a threshold net has been decomposed to a series of problems of learning of the threshold elements. The proposed learning algorithm of the threshold elements has a perceptron-like form. It was proven that a decision rule of the threshold net stabilizes after a finite number of steps. For definite classes (p(chi,omega))K of distributions p(chi, omega), an optimal decision rule stabilizes after a finite number of steps. These classes (p(chi, omega))K also contain distributions describing learning processes with perturbations.

Feedback↗

[Spectral signal recognition based on wavelet packet analysis].

Automated recognition of spectral signal is an importance part of spectral analysis, which jnvolves comparing spectral signals under the same conditions and obtaining relation of chemistry constitution according to similarity by pattern recognition method and computer technique, and is useful to determine the nature of spectral signal and validate spectral signal. This paper takes spectral signal according with Lambert-beer' law as object, introduces basic theory and method of recognition of spectral signal in brief, normalizes spectral signal to decrease difficulty, introduces wavelet analysis theory, puts forward the method of wavelet packet analysis to gain features of spectral signal, obtains formula to compute feature vector and error vector by statistics method, then makes use of binary tree' mode distinguishing step by step for quick recognition, and finally gives an example to explain.

Algorithms↗

Coexpression of cyt1Aa of Bacillus thuringiensis subsp. israelensis with Bacillus sphaericus binary toxin gene in acrystalliferous strain of B. thuringiensis.

The cyt1Aa gene of Bacillus thuringiensis subsp. israelensis and binary toxin gene of Bacillus sphaericus C3-41 were introduced into an acrystalliferous strain of B. thuringiensis independently and in combination by using shuttle vector pBU4. SDS-PAGE and Western blot analysis proved that cyt1Aa and binary toxin genes coexpressed during the sporulation of the recombinant. Transformant strain expressing the Cyt1Aa and binary toxin proteins in combination was more toxic to susceptible and resistant Culex pipiens quinquefasciatus than the transformants expressing Cyt1Aa protein or binary toxin proteins independently. It was suggested that large amount of production of Cyt1Aa protein and binary toxin proteins possibly interacted synergistically, thereby increasing its mosquitocidal toxicity significantly.

Animals↗