New ways to find compatible characters for phylogeny
Researchers used graph reduction and quantum sampling to improve the maximum compatibility criterion.
Researchers enhanced the approach by Cherry [BMC Bioinformatics, 18(1):127, 2017] to maximum compatibility. They introduced graph reduction techniques and quantum sampling.
Maximum compatibility is a criterion for phylogenetic reconstruction. The objective is to retain a maximum set of mutually compatible characters.
For binary characters, pairwise compatibility can be represented by a weighted graph. In this graph, vertices correspond to characters and edges connect compatible pairs.
The researchers used lossless graph reductions and hybrid sampling. They also constructed bespoke correction-in-the-loop Quantum Approximate Optimisation Algorithm instances.
The methods were demonstrated on graphs constructed from SARS-CoV-2 sequences. Results indicate that graph reduction and sampling can address the enumeration bottleneck.
Traditional Lagrange multiplier choices may not be optimal for the enumeration problem on noisy devices. This relates to exploring the prospects of quantum computational advantage.
Key facts
- The work enhances the maximum compatibility approach by Cherry [BMC Bioinformatics, 18(1):127, 2017].
- Graph reduction and sampling can be combined to address the enumeration bottleneck.
- The methods were demonstrated using graphs from SARS-CoV-2 sequences.