Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies

Lingfa Meng, David Salvador Novo, Albert H. Werner +1

We present a quantum algorithm in bioinformatics for solving the Binary Near-Perfect Phylogeny Problem (BNPP) with a complexity bound of $O(8.926^q+8^{q}nm2)$, where n is the numb…