On NP-Hardness of the Paired de Bruijn Sound Cycle Problem

The paired de Bruijn graph is an extension of de Bruijn graph incorporating mate pair information for genome assembly proposed by Mevdedev et al. However, unlike in an ordinary de Bruijn graph, not every path or cycle in a paired de Bruijn graph will spell a string, because there is an additional soundness constraint on the path. In this paper we show that the problem of checking if there is a sound cycle in a paired de Bruijn graph is NP-hard in general case. We also explore some of its special cases, as well as a modified version where the cycle must also pass through every edge.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013

Safe and complete contig assembly via omnitigs

Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs -- a set of strings that are promised to appear in any genome that could have generated the reads. From the introduction of contigs 20 years ago, assemblers have tried to obtain longer and longer contigs, but the following question was never solved: given a genome graph $G$ (e.g. a de Bruijn, or a string graph), what are all the strings that can be safely reported from $G$ as contigs? In this paper we finally answer this question, and also give a polynomial time algorithm to find them. Our experiments show that these strings, which we call omnitigs, are 66% to 82% longer on average than the popular unitigs, and 29% of dbSNP locations have more neighbors in omnitigs than in unitigs.Comment: Full version of the paper in the proceedings of RECOMB 201

Safe and Complete Contig Assembly Through Omnitigs

Peer reviewe

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Space programs summary no. 37-51, volume 3 for the period April 1 to May 31, 1968. Supporting research and advanced development

Space Programs Summary - supporting research and advanced developmen

Breast Cancer Biomarkers with Clinical Relevance Identified by Massively-parallel DNA and RNA Sequencing

Women have a 10% lifetime risk of developing breast cancer, and the disease has surpassed lung cancer as the most frequently diagnosed type of cancer in the world. Breast cancer originates in the epithelial cells of the mammary gland and tumor cells have undergone a series of genetic and phenotypic changes that confer tumor promoting properties.Genomic rearrangement is a common phenomenon in cancer, involving breakage and dysfunctional repair of chromosomes. With the aim to characterize such variants and their progression from primary to metastatic disease, we performed whole-genome sequencing of paired primary tumors and metastases (study I) and paired contralateral breast cancers (CBC) (study II). Metastasis rearrangement profiles bore a remarkable resemblance to the respective primary tumors (median 89% shared), indicating that the rearrangements were early events in tumor development, remaining stable throughout progression. Our study on CBC (study II) subsequently allowed us to identify 1 in 10 tumor pairs that likely represented metastatic spread rather than a new primary tumor (76% of rearrangements shared). One of the risk factors for breast cancer is high exposure to estrogens; signaling via estrogen receptor (ER) α is considered the most important driver for the 75% of tumors expressing this marker. Mutations in the gene for ERα are known to be common in endocrine therapy-refractory breast cancer and confer resistance to standard anti-hormonal treatment. In study III, we interrogated RNA-seq data from 3217 primary breast tumors from the SCAN-B initiative and found that 1% of tumors were positive for one of the mutations at surgery. For those patients that received adjuvant endocrine therapy, the mutations were associated to worse overall and relapse-free survival. In study IV, we further explored the SCAN-B dataset to investigate the phenotypic properties and prognosis associated to high expression of the much less well studied ERβ. We discovered that this receptor was not abundantly expressed, with 1/3 of tumors entirely negative. Further, we saw that patients with high levels of ERβ mRNA had slightly improved overall survival and that the expression of ERβ was associated to expression of genes involved in immune cell activation.In summary, we have employed sequencing technology to study breast cancer patient material to identify and assess the validity of genomic and transcriptomic changes that may both be of value as potential biomarkers, and in elucidating biological mechanisms that drive or suppress breast cancer progression

NASA Tech Briefs, April 1990

Topics: New Product Ideas; NASA TU Services; Electronic Components and Circuits; Electronic Systems; Physical Sciences; Materials; Computer Programs; Mechanics; Machinery; Fabrication Technology; Mathematics and Information Sciences

LIPIcs, Volume 248, ISAAC 2022, Complete Volume

LIPIcs, Volume 248, ISAAC 2022, Complete Volum