A QUBO formulation for the tree containment problem

DOI10.1016/j.tcs.2022.09.012OpenAlexW4226351562MaRDI QIDQ2699952

Pankaj S. Ghodla, Michael J. Dinneen, Simone Linz

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.11234

zbMATH Keywords

quantum computingtree containmentphylogenetic trees and networksQUBOs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Reticulation-visible networks
• On determining if tree-based networks contain fixed trees
• Seeing the trees and their branches in the network is hard
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Advances in unconventional computing. Volume 1. Theory
• Locating a tree in a phylogenetic network
• QUBO formulations for the graph isomorphism problem and related problems
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems
• Displaying trees across two phylogenetic networks
• Counting phylogenetic networks
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

This page was built for publication: A QUBO formulation for the tree containment problem