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

Determining the evolutionary history of a given biological data is animportant task in biological sciences. Given a set of quartet topologies over aset of taxa, the Maximum Quartet Consistency (MQC) problem consists ofcomputing a global phylogeny that satisfies the maximum number of quartets. Anumber of solutions have been proposed for the MQC problem, including DynamicProgramming, Constraint Programming, and more recently Answer Set Programming(ASP). ASP is currently the most efficient approach for optimally solving theMQC problem. This paper proposes encoding the MQC problem with pseudo-Boolean(PB) constraints. The use of PB allows solving the MQC problem with efficientPB solvers, and also allows considering different modeling approaches for theMQC problem. Initial results are promising, and suggest that PB can be aneffective alternative for solving the MQC problem.

A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem