Lossless Reductions and Hybrid Sampling for Phylogeny Using the Maximum Compatibility Criterion
This work forms the problem as maximum weight independent set enumeration on the complement graph and uses deterministic postprocessing to map sampled bit strings to maximal feasible solutions and enhances Cherry's approach to maximum compatibility by introducing graph reduction techniques and quantum sampling.