دورية أكاديمية
Approximate search for known gene clusters in new genomes using PQ-trees
| العنوان: | Approximate search for known gene clusters in new genomes using PQ-trees |
|---|---|
| المؤلفون: | Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson |
| المصدر: | Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-25 (2021) |
| بيانات النشر: | BMC, 2021. |
| سنة النشر: | 2021 |
| المجموعة: | LCC:Biology (General) LCC:Genetics |
| مصطلحات موضوعية: | PQ-tree, Gene cluster, Efflux pump, Biology (General), QH301-705.5, Genetics, QH426-470 |
| الوصف: | 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$$ d T and $$d_S$$ 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$$ d T and $$d_S$$ 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 })$$ O ∗ ( 2 γ ) time, where $$\gamma$$ γ is the maximum degree of a node in T and $$O^*$$ 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. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1748-7188 |
| Relation: | https://doaj.org/toc/1748-7188 |
| DOI: | 10.1186/s13015-021-00190-9 |
| URL الوصول: | https://doaj.org/article/f1a1dabf716e4cb0b0880f261010487d |
| رقم الأكسشن: | edsdoj.f1a1dabf716e4cb0b0880f261010487d |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 17487188 |
|---|---|
| DOI: | 10.1186/s13015-021-00190-9 |