Search

This study aimed to reveal the genetic and epigenetic variations involved in a resynthesized Brassica napus (AACC) generated from a hybridization between a B. rapa (AA) landrace and B. alboglabra (CC). Amplified fragment length polymorphism (AFLP), methylation-sensitive amplified polymorphism, and the cDNA-AFLP technique were performed to detect changes between different generations at the genome, methylation, and transcription levels. We obtained 30 lines of resynthesized B. napus with a mean 1000-seed weight of over 7.50 g. All of the lines were self-compatible, probably because both parents were self-compatible. At the genome level, the S0 generation had the lowest frequency of variations (0.18%) and the S3 generation had the highest (6.07%). The main variation pattern was the elimination of amplified restriction fragments on the CC genome from the S0 to the S4 generations. At the methylation level, we found three loci that exhibited altered methylation patterns on the parental A genome; the variance rate was 1.35%. At the transcription level, we detected 43.77% reverse mutations and 37.56% deletion mutations that mainly occurred on the A and C genomes, respectively, in the S3 generation. Our results highlight the genetic variations that occur during the diploidization of resynthesized B. napus.

Background: We investigated cytokines and angiogenic factors (CAFs) in patients with metastatic renal cell carcinoma (mRCC) treated in a randomized phase II clinical trial of sorafenib versus sorafenib+ interferon-α (IFN-α) that yielded no differences in progression-free survival (PFS). We aimed to link the CAF profile to PFS and select candidate predictive and prognostic markers for further study., Methods: The concentrations of 52 plasma CAFs were measured pretreatment (n = 69), day 28, and day 56 using multiplex bead arrays and enzyme-linked immunosorbent assay. We investigated the association between baseline levels of CAFs with PFS and posttreatment changes., Results: Unsupervised CAF clustering analysis revealed two distinct mRCC patient groups with elevated proangiogenic or proinflammatory mediators. A six-marker baseline CAF signature [osteopontin, vascular endothelial growth factor (VEGF), carbonic anhydrase 9, collagen IV, VEGF receptor-2, and tumor necrosis factor-related apoptosis-inducing ligand] correlated with PFS benefit (hazard ratio 0.20 versus 2.25, signature negative versus positive, respectively; P = 0.0002). While changes in angiogenic factors were frequently attenuated by the sorafenib+ IFN combination, most key immunomodulatory mediators increased., Conclusions: Using CAF profiling, we identified two mRCC patient groups, a candidate plasma signature for predicting PFS benefit, and distinct marker changes occurring with each treatment. This platform may provide valuable insights into renal cell carcinoma biology and the molecular consequences of targeted therapies.

Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d-disjunct). The three problems are all known to be coNP-complete. Since in most applications, d is a small integer compared to n, it is interesting to investigate whether there are efficient algorithms solving the above problems when the value of d is small. In this article, we give a negative answer to the above question by studying the parameterized complexity of these three problems, with d as the parameter. We show that the parameterized versions of all the three problems are co-W[2]-complete. An immediate implication of our results is that, given an m x n binary matrix and a positive integer d, a deterministic algorithm with running time f(d) x (mn)(O(1)) (where f is an arbitrary computable function) to decide whether the matrix is d-separable (d-separable, or d-disjunct) should not be expected.

The study of gene functions requires a DNA library of high quality, such a library is obtained from a large mount of testing and screening. Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. In this paper, we present new one- and two-stage pooling designs, together with new probabilistic pooling designs. The approach in this paper works for both error-free and error-tolerance scenarios.

The study of gene functions requires a DNA library of high quality, such a library is obtained from a large mount of testing and screening. Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. In this paper, we present two Las Vegas algorithms for efficient constructions of d-disjunct and (d ; z)-disjunct matrices respectively. These new constructions can be directly applied to construct error-free and error-tolerant pooling designs.

The study of gene functions requires the development of a DNA library of high quality through much of testing and screening. Pooling design is a mathematical tool to reduce the number of tests for DNA library screening. The transversal design is a special type of pooling design, which is good in implementation. In this paper, we present a new construction for transversal designs. We will also extend our construction to the error-tolerant case.

Let P be a set of n points on the euclidean plane. Let Ls(P) and Lm(P) denote the lengths of the Steiner minimum tree and the minimum spanning tree on P, respectively. In 1968, Gilbert and Pollak conjectured that for any P, Ls(P) >/= (radical3/2)Lm(P). We provide an abridged proof for their conjecture in this paper.