The Molecular Tumor Board Portal supports clinical decisions and automated reporting for precision oncology.

There is a growing need for systems that efficiently support the work of medical teams at the precision-oncology point of care. Here, we present the implementation of the Molecular Tumor Board Portal (MTBP), an academic clinical decision support system developed under the umbrella of Cancer Core Europe that creates a unified legal, scientific and technological platform to share and harness next-generation sequencing data. Automating the interpretation and reporting of sequencing results decrease the need for time-consuming manual procedures that are prone to errors. The adoption of an expert-agreed process to systematically link tumor molecular profiles with clinical actions promotes consistent decision-making and structured data capture across the connected centers. The use of information-rich patient reports with interactive content facilitates collaborative discussion of complex cases during virtual molecular tumor board meetings. Overall, streamlined digital systems like the MTBP are crucial to better address the challenges brought by precision oncology and accelerate the use of emerging biomarkers.

A Practical and Scalable Tool to Find Overlaps between Sequences.

The evolution of the next generation sequencing technology increases the demand for efficient solutions, in terms of space and time, for several bioinformatics problems. This paper presents a practical and easy-to-implement solution for one of these problems, namely, the all-pairs suffix-prefix problem, using a compact prefix tree. The paper demonstrates an efficient construction of this time-efficient and space-economical tree data structure. The paper presents techniques for parallel implementations of the proposed solution. Experimental evaluation indicates superior results in terms of space and time over existing solutions. Results also show that the proposed technique is highly scalable in a parallel execution environment.

Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem.

The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of the input data, it is crucial to use fast and space efficient solutions. In this paper, we present a space-economical solution to this problem using the generalized Sadakane compressed suffix tree. Furthermore, we present a parallel algorithm to provide more speed for shared memory computers. Our sequential and parallel algorithms are optimized by exploiting features of the Sadakane compressed index data structure. Experimental results show that our solution based on the Sadakane's compressed index consumes significantly less space than the ones based on noncompressed data structures like the suffix tree and the enhanced suffix array. Our experimental results show that our parallel algorithm is efficient and scales well with increasing number of processors.