Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that applied heuristic local searches, genetic algorithms, and randomized algorithms. In particular, Kao, Sanghi, and Schweller (2009) developed polynomial-time randomized algorithms to construct n DNA words of length within a multiplicative constant of the smallest possible word length (e.g., 9 max{log n, k}) that satisfy various sets of constraints with high probability. In this paper, we give deterministic polynomial-time algorithms to construct DNA words based on derandomization techniques. Our algorithms can construct n DNA words of shorter length (e.g., 2.1 log n + 6.28 k) and satisfy the same sets of constraints as the words constructed by the algorithms of Kao et al. Furthermore, we extend these new algorithms to construct words that satisfy a larger set of constraints for which the algorithms of Kao et al. do not work.Comment: 27 page

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

EpiAlign: an alignment-based bioinformatic tool for comparing chromatin state sequences.

The availability of genome-wide epigenomic datasets enables in-depth studies of epigenetic modifications and their relationships with chromatin structures and gene expression. Various alignment tools have been developed to align nucleotide or protein sequences in order to identify structurally similar regions. However, there are currently no alignment methods specifically designed for comparing multi-track epigenomic signals and detecting common patterns that may explain functional or evolutionary similarities. We propose a new local alignment algorithm, EpiAlign, designed to compare chromatin state sequences learned from multi-track epigenomic signals and to identify locally aligned chromatin regions. EpiAlign is a dynamic programming algorithm that novelly incorporates varying lengths and frequencies of chromatin states. We demonstrate the efficacy of EpiAlign through extensive simulations and studies on the real data from the NIH Roadmap Epigenomics project. EpiAlign is able to extract recurrent chromatin state patterns along a single epigenome, and many of these patterns carry cell-type-specific characteristics. EpiAlign can also detect common chromatin state patterns across multiple epigenomes, and it will serve as a useful tool to group and distinguish epigenomic samples based on genome-wide or local chromatin state patterns

An Elegant Algorithm for the Construction of Suffix Arrays

The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memory efficient alternative for suffix trees. The suffix array consists of the sorted suffixes of a string. There are several linear time suffix array construction algorithms (SACAs) known in the literature. However, one of the fastest algorithms in practice has a worst case run time of $O(n^2)$. The problem of designing practically and theoretically efficient techniques remains open. In this paper we present an elegant algorithm for suffix array construction which takes linear time with high probability; the probability is on the space of all possible inputs. Our algorithm is one of the simplest of the known SACAs and it opens up a new dimension of suffix array construction that has not been explored until now. Our algorithm is easily parallelizable. We offer parallel implementations on various parallel models of computing. We prove a lemma on the $\ell$-mers of a random string which might find independent applications. We also present another algorithm that utilizes the above algorithm. This algorithm is called RadixSA and has a worst case run time of $O(n\log{n})$. RadixSA introduces an idea that may find independent applications as a speedup technique for other SACAs. An empirical comparison of RadixSA with other algorithms on various datasets reveals that our algorithm is one of the fastest algorithms to date. The C++ source code is freely available at http://www.engr.uconn.edu/~man09004/radixSA.zi

Single-Molecule Analysis of i-motif Within Self-Assembled DNA Duplexes and Nanocircles

The cytosine (C)-rich sequences that can fold into tetraplex structures known as i-motif are prevalent in genomic DNA. Recent studies of i-motif–forming sequences have shown increasing evidence of their roles in gene regulation. However, most of these studies have been performed in short single-stranded oligonucleotides, far from the intracellular environment. In cells, i-motif–forming sequences are flanked by DNA duplexes and packed in the genome. Therefore, exploring the conformational dynamics and kinetics of i-motif under such topologically constrained environments is highly relevant in predicting their biological roles. Using single-molecule fluorescence analysis of self-assembled DNA duplexes and nanocircles, we show that the topological environments play a key role on i-motif stability and dynamics. While the human telomere sequence (C3TAA)3C3 assumes i-motif structure at pH 5.5 regardless of topological constraint, it undergoes conformational dynamics among unfolded, partially folded and fully folded states at pH 6.5. The lifetimes of i-motif and the partially folded state at pH 6.5 were determined to be 6 ± 2 and 31 ± 11 s, respectively. Consistent with the partially folded state observed in fluorescence analysis, interrogation of current versus time traces obtained from nanopore analysis at pH 6.5 shows long-lived shallow blockades with a mean lifetime of 25 ± 6 s. Such lifetimes are sufficient for the i-motif and partially folded states to interact with proteins to modulate cellular processes

Polyethylene glycol, unique among laxatives, suppresses aberrant crypt foci, by elimination of cells.

OBJECTIVE: Polyethylene glycol (PEG), an osmotic laxative, is a potent inhibitor of colon cancer in rats. In a search for the underling mechanisms, the hypothesis that fecal bulking and moisture decrease colon carcinogenesis was tested. We also investigated the PEG effects on crypt cells in vivo. MATERIAL AND METHODS: Fischer 344 rats (n=272) were injected with the colon carcinogen, azoxymethane. They were then randomized to a standard AIN76 diet containing one of 19 laxative agents (5% w/w in most cases): PEG 8000 and other PEG-like compounds, carboxymethylcellulose, polyvinylpyrrolidone, sodium polyacrylate, calcium polycarbophil, karaya gum, psyllium, mannitol, sorbitol, lactulose, propylene glycol, magnesium hydroxide, sodium phosphate, bisacodyl, docusate, and paraffin oil. Aberrant crypt foci (ACF) and fecal values were measured blindly after a 30-day treatment regimen. Proliferation, apoptosis, and the removal of cells from crypts were studied in control and PEG-fed rats using various methods, including TUNEL and fluorescein dextran labeling. RESULTS: PEG 8000 reduced the number of ACF 9-fold in rats (p40-fold) a fecal marker of epitheliolysis in the gut (p<0.001). PEG normalized the percentage of fluorescein dextran labeled cells on the top of ACF (p<0.001). CONCLUSIONS: Among laxatives, only PEG afforded potent chemoprevention. PEG protection was not due to increased fecal bulking, but in all likelihood to the elimination of cells from precancerous lesions

Discovery of a large set of SNP and SSR genetic markers by high-throughput sequencing of pepper (Capsicum annuum)

Genetic markers based on single nucleotide polymorphisms (SNPs) are in increasing demand for genome mapping and fingerprinting of breeding populations in crop plants. Recent advances in high-throughput sequencing provide the opportunity for whole-genome resequencing and identification of allelic variants by mapping the reads to a reference genome. However, for many species, such as pepper (Capsicum annuum), a reference genome sequence is not yet available. To this end, we sequenced the C. annuum cv. "Yolo Wonder" transcriptome using Roche 454 pyrosequencing and assembled de novo 23,748 isotigs and 60,370 singletons. Mapping of 10,886,425 reads obtained by the Illumina GA II sequencing of C. annuum cv. "Criollo de Morclos 334" to the "Yolo Wonder" transcriptome allowed for SNP identification. By setting a threshold value that allows selecting reliable SNPs with minimal loss of information, 11,849 reliable SNPs spread across 5919 isotigs were identified. In addition, 853 single sequence repeats were obtained. This information has been made available online

Tolerability and safety of the intake of bovine milk oligosaccharides extracted from cheese whey in healthy human adults.

Mechanistic research suggests a unique evolutionary relationship between complex milk oligosaccharides and cognate bifidobacteria enriched in breast-fed infants. Bovine milk oligosaccharides (BMO) were recently identified as structurally and functionally similar to human milk oligosaccharides. The present single-blind three-way crossover study is the first to determine the safety and tolerability of BMO consumption by healthy human participants (n 12) and its effects on faecal microbiota and microbial metabolism. Participants consumed each supplement (placebo-control; low- and high-BMO doses) for eleven consecutive days, followed by a 2-week washout period prior to initiating the next supplement arm. Low and high BMO doses were consumed as 25 and 35&nbsp;% of each individual's daily fibre intake, respectively. Safety and tolerability were measured using standardised questionnaires on gut and stomach discomfort and stool consistency. Faecal extracts were profiled for bacterial populations by next-generation sequencing (NGS) and bifidobacteria presence was confirmed using quantitative PCR. Urine was analysed for changes in microbial metabolism using nuclear magnetic resonance spectroscopy (1H-NMR). Consumption of both the low and high BMO doses was well tolerated and did not change stool consistency from baseline. Multivariate analysis of the NGS results demonstrated no change in faecal microbiota phyla among the placebo-control and BMO supplement groups. In conclusion, BMO supplementation was well tolerated in healthy adults and has the potential to shift faecal microbiota toward beneficial strains as part of a synbiotic treatment with probiotic cultures that selectively metabolise oligosaccharides