Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees

G. R. Zimerman, D. Svetlitsky, M. Zehavi +1

We define a new problem in comparative genomics, denoted PQ-Tree Search, that takes as input a PQ-tree $T$ representing the known gene orders of a gene cluster of interest, a gene-…