Kyrios Jesus

The author provides a perceptive and pastoral analysis of the key issue before the Synod

The informatics challenges facing biobanks:a perspective from a United Kingdom biobanking network

The challenges facing biobanks are changing from simple collections of materials to quality-assured fit-for-purpose clinically annotated samples. As a result, informatics awareness and capabilities of a biobank are now intrinsically related to quality. A biobank may be considered a data repository, in the form of raw data (the unprocessed samples), data surrounding the samples (processing and storage conditions), supplementary data (such as clinical annotations), and an increasing ethical requirement for biobanks to have a mechanism for researchers to return their data. The informatics capabilities of a biobank are no longer simply knowing sample locations; instead the capabilities will become a distinguishing factor in the ability of a biobank to provide appropriate samples. There is an increasing requirement for biobanking systems (whether in-house or com-mercially sourced) to ensure the informatics systems stay apace with the changes being experienced by the biobanking community. In turn, there is a requirement for the biobanks to have a clear informatics policy and directive that is embedded into the wider decision making process. As an example, the Breast Cancer Campaign Tissue Bank in the UK was a collaboration between four individual and diverse biobanks in the UK, and an informatics platform has been developed to address the challenges of running a distributed network. From developing such a system there are key observations about what can or cannot be achieved by informatics in isolation. This article will highlight some of the lessons learned during this development process

STK295900, a Dual Inhibitor of Topoisomerase 1 and 2, Induces G<inf>2</inf> Arrest in the Absence of DNA Damage

STK295900, a small synthetic molecule belonging to a class of symmetric bibenzimidazoles, exhibits antiproliferative activity against various human cancer cell lines from different origins. Examining the effect of STK295900 in HeLa cells indicates that it induces G2 phase arrest without invoking DNA damage. Further analysis shows that STK295900 inhibits DNA relaxation that is mediated by topoisomerase 1 (Top 1) and topoisomerase 2 (Top 2) in vitro. In addition, STK295900 also exhibits protective effect against DNA damage induced by camptothecin. However, STK295900 does not affect etoposide-induced DNA damage. Moreover, STK295900 preferentially exerts cytotoxic effect on cancer cell lines while camptothecin, etoposide, and Hoechst 33342 affected both cancer and normal cells. Therefore, STK295900 has a potential to be developed as an anticancer chemotherapeutic agent. © 2013 Kim et al

Diagnostic algorithm for papillary urothelial tumors in the urinary bladder

Papillary urothelial neoplasms with deceptively bland cytology cannot be easily classified. We aimed to design a new algorithm that could differentiate between these neoplasms based on a scoring system. We proposed a new scoring system that enables to reproducibly diagnose non-invasive papillary urothelial tumors. In this system, each lesion was given individual scores from 0 to 3 for mitosis and cellular thickness, from 0 to 2 for cellular atypia, and an additional score for papillary fusion. These scores were combined to form a summed score allowing the tumors to be ranked as follows: 0–1 = UP, 2–4 = low malignant potential (LMP), 5–7 = low-grade transitional cell carcinoma (TCC), and 8–9 = high-grade TCC. In addition to the scoring system, ancillary studies of MIB and p53 indexes with CK20 expression pattern analyses were compared together with clinical parameters. The MIB index was strongly correlated with disease progression. Four of the 22 LMP patients (18.2%) had late recurrences, two of these four (9.1%) had progression to low-grade carcinoma. The MIB index for LMP patients was strongly associated with recurrence (recurrence vs. non-recurrence, 16.5 vs. 8.1, p < 0.001). The proposed scoring system could enhance the reproducibility to distinguish papillary urothelial neoplasms

Smc5/6 coordinates formation and resolution of joint molecules with chromosome morphology to ensure meiotic divisions

During meiosis, Structural Maintenance of Chromosome (SMC) complexes underpin two fundamental features of meiosis: homologous recombination and chromosome segregation. While meiotic functions of the cohesin and condensin complexes have been delineated, the role of the third SMC complex, Smc5/6, remains enigmatic. Here we identify specific, essential meiotic functions for the Smc5/6 complex in homologous recombination and the regulation of cohesin. We show that Smc5/6 is enriched at centromeres and cohesin-association sites where it regulates sister-chromatid cohesion and the timely removal of cohesin from chromosomal arms, respectively. Smc5/6 also localizes to recombination hotspots, where it promotes normal formation and resolution of a subset of joint-molecule intermediates. In this regard, Smc5/6 functions independently of the major crossover pathway defined by the MutLγ complex. Furthermore, we show that Smc5/6 is required for stable chromosomal localization of the XPF-family endonuclease, Mus81-Mms4Eme1. Our data suggest that the Smc5/6 complex is required for specific recombination and chromosomal processes throughout meiosis and that in its absence, attempts at cell division with unresolved joint molecules and residual cohesin lead to severe recombination-induced meiotic catastroph

A fresh look at the evolution and diversification of photochemical reaction centers

In this review, I reexamine the origin and diversification of photochemical reaction centers based on the known phylogenetic relations of the core subunits, and with the aid of sequence and structural alignments. I show, for example, that the protein folds at the C-terminus of the D1 and D2 subunits of Photosystem II, which are essential for the coordination of the water-oxidizing complex, were already in place in the most ancestral Type II reaction center subunit. I then evaluate the evolution of reaction centers in the context of the rise and expansion of the different groups of bacteria based on recent large-scale phylogenetic analyses. I find that the Heliobacteriaceae family of Firmicutes appears to be the earliest branching of the known groups of phototrophic bacteria; however, the origin of photochemical reaction centers and chlorophyll synthesis cannot be placed in this group. Moreover, it becomes evident that the Acidobacteria and the Proteobacteria shared a more recent common phototrophic ancestor, and this is also likely for the Chloroflexi and the Cyanobacteria. Finally, I argue that the discrepancies among the phylogenies of the reaction center proteins, chlorophyll synthesis enzymes, and the species tree of bacteria are best explained if both types of photochemical reaction centers evolved before the diversification of the known phyla of phototrophic bacteria. The primordial phototrophic ancestor must have had both Type I and Type II reaction centers

On the notion of composite system

The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.Comment: 9 pages. Comments are welcom

Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability

<p>Abstract</p> <p>Background</p> <p>In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accuracy of a phylogeny reconstruction method is measured by simulations on synthetic datasets with known "true" phylogenies, while little theoretical analysis has been done. In this paper, we present a new model-based approach to measuring the accuracy of a quartet-based phylogeny reconstruction method. Under this model, we propose three efficient algorithms to reconstruct the "true" phylogeny with a high success probability.</p> <p>Results</p> <p>The first algorithm can reconstruct the "true" phylogeny from the input quartet topology set without quartet errors in <it>O</it>(<it>n</it>²) time by querying at most (<it>n </it>- 4) log(<it>n </it>- 1) quartet topologies, where <it>n </it>is the number of the taxa. When the input quartet topology set contains errors, the second algorithm can reconstruct the "true" phylogeny with a probability approximately 1 - <it>p </it>in <it>O</it>(<it>n</it>⁴log <it>n</it>) time, where <it>p </it>is the probability for a quartet topology being an error. This probability is improved by the third algorithm to approximately <inline-formula><m:math name="1748-7188-3-1-i1" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mrow><m:mfrac><m:mn>1</m:mn><m:mrow><m:mn>1</m:mn><m:mo>+</m:mo><m:msup><m:mi>q</m:mi><m:mn>2</m:mn></m:msup><m:mo>+</m:mo><m:mfrac><m:mn>1</m:mn><m:mn>2</m:mn></m:mfrac><m:msup><m:mi>q</m:mi><m:mn>4</m:mn></m:msup><m:mo>+</m:mo><m:mfrac><m:mn>1</m:mn><m:mrow><m:mn>16</m:mn></m:mrow></m:mfrac><m:msup><m:mi>q</m:mi><m:mn>5</m:mn></m:msup></m:mrow></m:mfrac></m:mrow><m:annotation encoding="MathType-MTEF"> MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaqcfa4aaSaaaeaacqaIXaqmaeaacqaIXaqmcqGHRaWkcqWGXbqCdaahaaqabeaacqaIYaGmaaGaey4kaSYaaSaaaeaacqaIXaqmaeaacqaIYaGmaaGaemyCae3aaWbaaeqabaGaeGinaqdaaiabgUcaRmaalaaabaGaeGymaedabaGaeGymaeJaeGOnaydaaiabdghaXnaaCaaabeqaaiabiwda1aaaaaaaaa@3D5A@</m:annotation></m:semantics></m:math></inline-formula>, where <inline-formula><m:math name="1748-7188-3-1-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mrow><m:mi>q</m:mi><m:mo>=</m:mo><m:mfrac><m:mi>p</m:mi><m:mrow><m:mn>1</m:mn><m:mo>−</m:mo><m:mi>p</m:mi></m:mrow></m:mfrac></m:mrow><m:annotation encoding="MathType-MTEF"> MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaemyCaeNaeyypa0tcfa4aaSaaaeaacqWGWbaCaeaacqaIXaqmcqGHsislcqWGWbaCaaaaaa@3391@</m:annotation></m:semantics></m:math></inline-formula>, with running time of <it>O</it>(<it>n</it>⁵), which is at least 0.984 when <it>p </it>< 0.05.</p> <p>Conclusion</p> <p>The three proposed algorithms are mathematically guaranteed to reconstruct the "true" phylogeny with a high success probability. The experimental results showed that the third algorithm produced phylogenies with a higher probability than its aforementioned theoretical lower bound and outperformed some existing phylogeny reconstruction methods in both speed and accuracy.</p

Proteinortho: Detection of (Co-)orthologs in large-scale analysis

<p>Abstract</p> <p>Background</p> <p>Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing flood of sequence data, and hence the rapidly increasing number of genomes that can be compared simultaneously, calls for efficient software tools as brute-force approaches with quadratic memory requirements become infeasible in practise. The rapid pace at which new data become available, furthermore, makes it desirable to compute genome-wide orthology relations for a given dataset rather than relying on relations listed in databases.</p> <p>Results</p> <p>The program <monospace>Proteinortho</monospace> described here is a stand-alone tool that is geared towards large datasets and makes use of distributed computing techniques when run on multi-core hardware. It implements an extended version of the reciprocal best alignment heuristic. We apply <monospace>Proteinortho</monospace> to compute orthologous proteins in the complete set of all 717 eubacterial genomes available at NCBI at the beginning of 2009. We identified thirty proteins present in 99% of all bacterial proteomes.</p> <p>Conclusions</p> <p><monospace>Proteinortho</monospace> significantly reduces the required amount of memory for orthology analysis compared to existing tools, allowing such computations to be performed on off-the-shelf hardware.</p