Magnetic Susceptibility for CaV4O9CaV_4O_9

We examine experimental magnetic susceptibility $\chi^{tot}(T)$ for CaV$_4$O$_9$ by fitting with fitting function $\alpha \chi^{mag}(T) + c$. The function $\chi^{mag}(T)$ is a power series of 1/T and the lowest order term is fixed as $C/T$, where $C$ is the Curie constant as determined by the experimental $g$-value (g=1.96). Fitting parameters are $\alpha$, $c$ and expansion coefficients except for the first one in $\chi^{mag}(T)$. We determine $\alpha$ and $c$ as $\alpha \simeq$ 0.73 and $c\simeq$ 0 for an experimental sample. We interpret $\alpha$ as the volume fraction of CaV$_4$O$_9$ in the sample and $\chi^{mag}(T)$ as the susceptibility for the pure CaV$_4$O$_9$. The result of $\alpha \ne 1$ means that the sample includes nonmagnetic components. This interpretation consists with the result of a perturbation theory and a neutron scattering experiment.Comment: 4pages, 4figure

The Heisenberg model on the 1/5-depleted square lattice and the CaV4O9 compound

We investigate the ground state structure of the Heisenberg model on the 1/5-depleted square lattice for arbitrary values of the first- and second-neighbor exchange couplings. By using a mean-field Schwinger-boson approach we present a unified description of the rich ground-state diagram, which include the plaquette and dimer resonant-valence-bond phases, an incommensurate phase and other magnetic orders with complex magnetic unit cells. We also discuss some implications of ours results for the experimental realization of this model in the CaV4O9 compound.Comment: 4 pages, Latex, 7 figures included as eps file

Multiple sequence alignment based on set covers

We introduce a new heuristic for the multiple alignment of a set of sequences. The heuristic is based on a set cover of the residue alphabet of the sequences, and also on the determination of a significant set of blocks comprising subsequences of the sequences to be aligned. These blocks are obtained with the aid of a new data structure, called a suffix-set tree, which is constructed from the input sequences with the guidance of the residue-alphabet set cover and generalizes the well-known suffix tree of the sequence set. We provide performance results on selected BAliBASE amino-acid sequences and compare them with those yielded by some prominent approaches

Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise linear gap cost

BACKGROUND: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy and speed. In the alignment of a family of protein sequences, global MSA algorithms perform better than local ones in many cases, while local ones perform better than global ones when some sequences have long insertions or deletions (indels) relative to others. Many recent leading MSA algorithms have incorporated pairwise alignment information obtained from a mixture of sources into their scoring system to improve accuracy of alignment containing long indels. RESULTS: We propose a novel group-to-group sequence alignment algorithm that uses a piecewise linear gap cost. We developed a program called PRIME, which employs our proposed algorithm to optimize the well-defined sum-of-pairs score. PRIME stands for Profile-based Randomized Iteration MEthod. We evaluated PRIME and some recent MSA programs using BAliBASE version 3.0 and PREFAB version 4.0 benchmarks. The results of benchmark tests showed that PRIME can construct accurate alignments comparable to the most accurate programs currently available, including L-INS-i of MAFFT, ProbCons, and T-Coffee. CONCLUSION: PRIME enables users to construct accurate alignments without having to employ pairwise alignment information. PRIME is available at