Approximate search for known gene clusters in new genomes using PQ-trees
Open Access
- 9 July 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Algorithms for Molecular Biology
- Vol. 16 (1), 1-25
- https://doi.org/10.1186/s13015-021-00190-9
Abstract
Gene clusters are groups of genes that are co-locally conserved across various genomes, not necessarily in the same order. Their discovery and analysis is valuable in tasks such as gene annotation and prediction of gene interactions, and in the study of genome organization and evolution. The discovery of conserved gene clusters in a given set of genomes is a well studied problem, but with the rapid sequencing of prokaryotic genomes a new problem is inspired. Namely, given an already known gene cluster that was discovered and studied in one genomic dataset, to identify all the instances of the gene cluster in a given new genomic sequence. Thus, 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-to-gene substitution scoring function h, integer arguments \(d_T\) and \(d_S\), and a new sequence of genes S. The objective is to identify in S approximate new instances of the gene cluster; These instances could vary from the known gene orders by genome rearrangements that are constrained by T, by gene substitutions that are governed by h, and by gene deletions and insertions that are bounded from above by \(d_T\) and \(d_S\), respectively. We prove that PQ-Tree Search is NP-hard and propose a parameterized algorithm that solves the optimization variant of PQ-Tree Search in \(O^*(2^{\gamma })\) time, where \(\gamma\) is the maximum degree of a node in T and \(O^*\) is used to hide factors polynomial in the input size. The algorithm is implemented as a search tool, denoted PQFinder, and applied to search for instances of chromosomal gene clusters in plasmids, within a dataset of 1,487 prokaryotic genomes. We report on 29 chromosomal gene clusters that are rearranged in plasmids, where the rearrangements are guided by the corresponding PQ-trees. One of these results, coding for a heavy metal efflux pump, is further analysed to exemplify how PQFinder can be harnessed to reveal interesting new structural variants of known gene clusters.
Keywords
Funding Information
- Planning and Budgeting Committee of the Council for Higher Education of Israel
- Israel Science Foundation (1176/18, 1176/18)
- Israel Science Foundation (939/18, 939/18)
- Israel Science Foundation (939/18)
- The Frankel Center for Computer Science at Ben Gurion University
This publication has 52 references indexed in Scilit:
- A large-scale evaluation of computational protein function predictionNature Methods, 2013
- Conjugative plasmids: vessels of the communal gene poolPhilosophical Transactions B, 2009
- Semantic integration to identify overlapping functional modules in protein interaction networksBMC Bioinformatics, 2007
- Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte EvolutionJournal of Computational Biology, 2007
- Gene Proximity Analysis across Whole Genomes via PQ Trees1Journal of Computational Biology, 2005
- Identifying Conserved Gene Clusters in the Presence of Homology FamiliesJournal of Computational Biology, 2005
- Fast Algorithms to Enumerate All Common Intervals of Two PermutationsAlgorithmica, 2000
- A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-ProbesJournal of Computational Biology, 1997
- Complexity results for scheduling tasks with discrete starting timesJournal of Algorithms, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976