Cargando…
Approximate search for known gene clusters in new genomes using PQ-trees
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 discove...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8272295/ https://www.ncbi.nlm.nih.gov/pubmed/34243815 http://dx.doi.org/10.1186/s13015-021-00190-9 |
_version_ | 1783721189685854208 |
---|---|
author | Zimerman, Galia R. Svetlitsky, Dina Zehavi, Meirav Ziv-Ukelson, Michal |
author_facet | Zimerman, Galia R. Svetlitsky, Dina Zehavi, Meirav Ziv-Ukelson, Michal |
author_sort | Zimerman, Galia R. |
collection | PubMed |
description | 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 [Formula: see text] and [Formula: see text] , 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 [Formula: see text] and [Formula: see text] , 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 [Formula: see text] time, where [Formula: see text] is the maximum degree of a node in T and [Formula: see text] 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. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at 10.1186/s13015-021-00190-9. |
format | Online Article Text |
id | pubmed-8272295 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-82722952021-07-12 Approximate search for known gene clusters in new genomes using PQ-trees Zimerman, Galia R. Svetlitsky, Dina Zehavi, Meirav Ziv-Ukelson, Michal Algorithms Mol Biol Research 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 [Formula: see text] and [Formula: see text] , 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 [Formula: see text] and [Formula: see text] , 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 [Formula: see text] time, where [Formula: see text] is the maximum degree of a node in T and [Formula: see text] 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. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at 10.1186/s13015-021-00190-9. BioMed Central 2021-07-09 /pmc/articles/PMC8272295/ /pubmed/34243815 http://dx.doi.org/10.1186/s13015-021-00190-9 Text en © The Author(s) 2021 https://creativecommons.org/licenses/by/4.0/Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/ (https://creativecommons.org/publicdomain/zero/1.0/) ) applies to the data made available in this article, unless otherwise stated in a credit line to the data. |
spellingShingle | Research Zimerman, Galia R. Svetlitsky, Dina Zehavi, Meirav Ziv-Ukelson, Michal Approximate search for known gene clusters in new genomes using PQ-trees |
title | Approximate search for known gene clusters in new genomes using PQ-trees |
title_full | Approximate search for known gene clusters in new genomes using PQ-trees |
title_fullStr | Approximate search for known gene clusters in new genomes using PQ-trees |
title_full_unstemmed | Approximate search for known gene clusters in new genomes using PQ-trees |
title_short | Approximate search for known gene clusters in new genomes using PQ-trees |
title_sort | approximate search for known gene clusters in new genomes using pq-trees |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8272295/ https://www.ncbi.nlm.nih.gov/pubmed/34243815 http://dx.doi.org/10.1186/s13015-021-00190-9 |
work_keys_str_mv | AT zimermangaliar approximatesearchforknowngeneclustersinnewgenomesusingpqtrees AT svetlitskydina approximatesearchforknowngeneclustersinnewgenomesusingpqtrees AT zehavimeirav approximatesearchforknowngeneclustersinnewgenomesusingpqtrees AT zivukelsonmichal approximatesearchforknowngeneclustersinnewgenomesusingpqtrees |