English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we will introduce an exact algorithm with a time complexity of$O^*(1.299^m)$ for the {\sc weighted mutually exclusive set cover} problem,where $m$ is the number of subsets in the problem. This problem has importantapplications in recognizing mutation genes that cause different cancerdiseases.

An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem