Testing predictions of macroscopic binary diffusion coefficients using lattice models with site heterogeneity

Quantitatively predicting mass transport rates for chemical mixtures in porous materials is important in applications of materials such as adsorbents, membranes, and catalysts. Because directly assessing mixture transport experimentally is challenging, theoretical models that can predict mixture diffusion coefficients using Only single-component information would have many uses. One such model was proposed by Skoulidas, Sholl, and Krishna (Langmuir, 2003, 19, 7977), and applications of this model to a variety of chemical mixtures in nanoporous materials have yielded promising results. In this paper, the accuracy of this model for predicting mixture diffusion coefficients in materials that exhibit a heterogeneous distribution of local binding energies is examined. To examine this issue, single-component and binary mixture diffusion coefficients are computed using kinetic Monte Carlo for a two-dimensional lattice model over a wide range of lattice occupancies and compositions. The approach suggested by Skoulidas, Sholl, and Krishna is found to be accurate in situations where the spatial distribution of binding site energies is relatively homogeneous, but is considerably less accurate for strongly heterogeneous energy distributions.

TCR{alpha} Genes Direct MHC Restriction in the Potent Human T Cell Response to a Class I-Bound Viral Epitope

The underlying generic properties of {alpha}β TCRs that control MHC restriction remain largely unresolved. To investigate MHC restriction, we have examined the CTL response to a viral epitope that binds promiscuously to two human leukocyte Ags (HLAs) that differ by a single amino acid at position 156. Individuals expressing either HLA-B*3501 (156Leucine) or HLA-B*3508 (156Arginine) showed a potent CTL response to the 407HPVGEADYFEY417 epitope from EBV. Interestingly, the response was characterized by highly restricted TCR β-chain usage in both HLA-B*3501+ and HLA-B*3508+ individuals; however, this conserved TRBV9+ β-chain was associated with distinct TCR {alpha}-chains depending upon the HLA-B*35 allele expressed by the virus-exposed host. Functional assays confirmed that TCR {alpha}-chain usage determined the HLA restriction of the CTLs. Structural studies revealed significant differences in the mobility of the peptide when bound to HLA-B*3501 or HLA-B*3508. In HLA-B*3501, the bulged section of the peptide was disordered, whereas in HLA-B*3508 the bulged epitope adopted an ordered conformation. Collectively, these data demonstrate not only that mobile MHC-bound peptides can be highly immunogenic but can also stimulate an extremely biased TCR repertoire. In addition, TCR {alpha}-chain usage is shown to play a critical role in controlling MHC restriction between closely related allomorphs.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE

Efficient spatial clustering algorithm using binary tree

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005