Background: Trastuzumab in combination with chemotherapy has long been established as a standard treatment for HER2-positive patients in early stage breast cancer (BC). The present study aimed at assessing the effectiveness of trastuzumab adjuvant therapy in early stage BC in overall survival (OS) and disease-free survival (DFS).    Methods: A systematic review and meta-analysis was ...

The notion of a (closed) double-framed soft ideal (briefly, a (closed) DFS-ideal) in BCK/BCI-algebras is introduced, and related properties are investigated. Several examples are provided. The relation between a DFS-algebra and a DFS-ideal is considered, and characterizations of a (closed) DFS-ideal are established. A new DFS-ideal from old one is constructed, and we show that the int-uni DFS-s...

In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...

Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST. We have obtained similar ...

We show that depth first search can be used to give a proper coloring of connected signed graphs G using at most ∆(G) colors, provided G is different from a balanced complete graph, a balanced cycle of odd length, and an unbalanced cycle of even length, thus giving a new, short proof to the generalization of Brooks’ theorem to signed graphs, first proved by Máčajová, Raspaud, and Škoviera.

In this paper we demonstrate the automated verification of the Nested Depth-First Search (NDFS) algorithm for detecting accepting cycles. The starting point is a recursive formulation of the NDFS algorithm. We use Dafny to annotate the algorithm with invariants and a global specification. The global specification requires that NDFS indeed solves the accepting cycle problem. The invariants are p...

UNLABELLED Intracytoplasmic sperm injection (ICSI) in mice using DNA-fragmented sperm (DFS) has been linked to an increased risk of genetic and epigenetic abnormalities both in embryos and offspring. This study examines: whether embryonic stem cells (ESCs) derived from DFS-ICSI embryos reflect the abnormalities observed in the DFS-ICSI progeny; the effect of DFS-ICSI on male fertility; and whet...