MOTIVATION: Only a few large systematic studies have evaluated the impact of copy number variants (CNVs) on common diseases. Several million individuals have been genotyped on single nucleotide variation arrays, which could be used for genome-wide CNVs association studies. However, CNV calls remain prone to false positives and only empirical filtering strategies exist in the literature. To overcome this issue, we defined a new quality score (QS) estimating the probability of a CNV called by PennCNV to be confirmed by other software. RESULTS: Out-of-sample comparison showed that the correlation between the consensus CNV status and the QS is twice as high as it is for any previously proposed CNV filters. ROC curves displayed an AUC higher than 0.8 and simulations showed an increase up to 20% in statistical power when using QS in comparison to other filtering strategies. Superior performance was confirmed also for alternative consensus CNV definition and through improving known CNV-trait associations. AVAILABILITY AND IMPLEMENTATION: http://goo.gl/T6yuFM CONTACT: [email protected] or aurelien@[email protected] information: Supplementary data are available at Bioinformatics online.

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics, and is a variant of the perfect phylogeny haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is "full" genotypes, here we assume less informative input, and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time, by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by that tree they map onto, and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes, and present a linear algorithm for identifying those genotypes.

Summary: An easy-to-use, versatile and freely available graphic web server, FoldIndex© is described: it predicts if a given protein sequence is intrinsically unfolded implementing the algorithm of Uversky and co-workers, which is based on the average residue hydrophobicity and net charge of the sequence. FoldIndex© has an error rate comparable to that of more sophisticated fold prediction methods. Sliding windows permit identification of large regions within a protein that possess folding propensities different from those of the whole protein. Availability: FoldIndex© can be accessed at http://bioportal.weizmann.ac.il/fldbin/findex Contact: [email protected] Supplementary information: http://www.weizmann.ac.il/sb/faculty_pages/Sussman/papers/suppl/Prilusky_2005

Recent efforts to characterize genetic variation indicate that humans share large chromosomal blocks, along which little to no recombination is observable. Thus, on a segment-by-segment basis, only a handful of haplotypes account for most human genotypes. Currently, the challenge of registering haplotypes and their frequencies is met by genotyping individuals one by one, a process which is overall resource intensive. Instead, we propose utilizing the ability of current genotyping technologies to pool DNA samples and output allele frequencies of SNP markers. We enable inference of haplotypes and haplotype frequencies from such pooled data, by novel computational methods. This strategy harnesses the economics of pooling for the task of haplotyping, potentially offering a 10-20-fold saving in genotyping reactions performed.We show that a small number of pools can be used to accurately and cost-effectively reconstruct a haplotype block and determine haplotype frequencies.