Somatic variants play a crucial role in the occurrence and progression of cancer. However, in the absence of matched normal controls, distinguishing between germline and somatic variants becomes challenging in tumor samples. The existing tumor-only genomic analysis methods either suffer from limited performance or insufficient interpretability due to an excess of features. Therefore, there is an urgent need for an alternative approach that can address these issues and have practical implications. Here, we presented OncoTOP, a computational method for genomic analysis without matched normal samples, which can accurately distinguish somatic mutations from germline variants. Reference sample analysis revealed a 0% false positive rate and 99.7% reproducibility for variant calling. Assessing 2864 tumor samples across 18 cancer types yielded a 99.8% overall positive percent agreement and a 99.9% positive predictive value. OncoTOP can also accurately detect clinically actionable variants and subclonal mutations associated with drug resistance. For the prediction of mutation origins, the positive percent agreement stood at 97.4% for predicting somatic mutations and 95.7% for germline mutations. High consistency of tumor mutational burden (TMB) was observed between the results generated by OncoTOP and tumor-normal paired analysis. In a cohort of 97 lung cancer patients treated with immunotherapy, TMB-high patients had prolonged PFS (P = .02), proving the reliability of our approach in estimating TMB to predict therapy response. Furthermore, microsatellite instability status showed a strong concordance (97%) with polymerase chain reaction results, and leukocyte antigens class I subtypes and homozygosity achieved an impressive concordance rate of 99.3% and 99.9% respectively, compared to its tumor-normal paired analysis. Thus, OncoTOP exhibited high reliability in variant calling, mutation origin prediction, and biomarker estimation. Its application will promise substantial advantages for clinical genomic testing.

Duplex sequencing technology has been widely used in the detection of low-frequency mutations in circulating tumor deoxyribonucleic acid (DNA), but how to determine the sequencing depth and other experimental parameters to ensure the stable detection of low-frequency mutations is still an urgent problem to be solved. The mutation detection rules of duplex sequencing constrain not only the number of mutated templates but also the number of mutation-supportive reads corresponding to each forward and reverse strand of the mutated templates. To tackle this problem, we proposed a Depth Estimation model for stable detection of Low-Frequency MUTations in duplex sequencing (DELFMUT), which models the identity correspondence and quantitative relationships between templates and reads using the zero-truncated negative binomial distribution without considering the sequences composed of bases. The results of DELFMUT were verified by real duplex sequencing data. In the case of known mutation frequency and mutation detection rule, DELFMUT can recommend the combinations of DNA input and sequencing depth to guarantee the stable detection of mutations, and it has a great application value in guiding the experimental parameter setting of duplex sequencing technology.

SUMMARY: Sequence-to-structure alignment in template-based protein structure modeling for remote homologs remains a difficult problem even following the correct recognition of folds. Here we present MICAlign, a sequence-to-structure alignment tool that incorporates multiple sources of information from local structural contexts of template, sequence profiles, predicted secondary structures, solvent accessibilities, potential-like terms (including residue-residue contacts and solvent exposures) and pre-aligned structures and sequences. These features, together with a position-specific gap scheme, were integrated into conditional random fields through which the optimal parameters were automatically learned. MICAlign showed improved alignment accuracy over several other state-of-the-art alignment tools based on comparisons by using independent datasets. AVAILABILITY: Freely available at (http://www.bioinfo.tsinghua.edu.cn/~xiaxf/micalign) for both web server and source code.

BACKGROUND: Subcellular localization information is one of the key features to protein function research. Locating to a specific subcellular compartment is essential for a protein to function efficiently. Proteins which have multiple localizations will provide more clues. This kind of proteins may take a high proportion, even more than 35%. DESCRIPTION: We have developed a database of proteins with multiple subcellular localizations, designated DBMLoc. The initial release contains 10470 multiple subcellular localization-annotated entries. Annotations are collected from primary protein databases, specific subcellular localization databases and literature texts. All the protein entries are cross-referenced to GO annotations and SwissProt. Protein-protein interactions are also annotated. They are classified into 12 large subcellular localization categories based on GO hierarchical architecture and original annotations. Download, search and sequence BLAST tools are also available on the website. CONCLUSION: DBMLoc is a protein database which collects proteins with more than one subcellular localization annotation. It is freely accessed at http://www.bioinfo.tsinghua.edu.cn/DBMLoc/index.htm.

We uncovered the underlying energy landscape for a cellular network. We discovered that the energy landscape of the yeast cell-cycle network is funneled towards the global minimum (G0/G1 phase) from the experimentally measured or inferred inherent chemical reaction rates. The funneled landscape is quite robust against random perturbations. This naturally explains robustness from a physical point of view. The ratio of slope versus roughness of the landscape becomes a quantitative measure of robustness of the network. The funneled landscape can be seen as a possible realization of the Darwinian principle of natural selection at the cellular network level. It provides an optimal criterion for network connections and design. Our approach is general and can be applied to other cellular networks.