Cargando…
Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model
Reconstruction of the median genome consisting of linear chromosomes from three given genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the median genome is allowed to have circular chromosomes. We propose a method for construction...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
SAGE Publications
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6557028/ https://www.ncbi.nlm.nih.gov/pubmed/31217687 http://dx.doi.org/10.1177/1176934318820534 |
_version_ | 1783425410144403456 |
---|---|
author | Avdeyev, Pavel Jiang, Shuai Alekseyev, Max A |
author_facet | Avdeyev, Pavel Jiang, Shuai Alekseyev, Max A |
author_sort | Avdeyev, Pavel |
collection | PubMed |
description | Reconstruction of the median genome consisting of linear chromosomes from three given genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the median genome is allowed to have circular chromosomes. We propose a method for construction of an approximate solution to the original problem from a solution to the relaxed problem and prove a bound on its approximation error. Our method also provides insights into the combinatorial structure of genome transformations with respect to appearance of circular chromosomes. |
format | Online Article Text |
id | pubmed-6557028 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | SAGE Publications |
record_format | MEDLINE/PubMed |
spelling | pubmed-65570282019-06-19 Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model Avdeyev, Pavel Jiang, Shuai Alekseyev, Max A Evol Bioinform Online Algorithm development for evolutionary biological computation Reconstruction of the median genome consisting of linear chromosomes from three given genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the median genome is allowed to have circular chromosomes. We propose a method for construction of an approximate solution to the original problem from a solution to the relaxed problem and prove a bound on its approximation error. Our method also provides insights into the combinatorial structure of genome transformations with respect to appearance of circular chromosomes. SAGE Publications 2019-06-06 /pmc/articles/PMC6557028/ /pubmed/31217687 http://dx.doi.org/10.1177/1176934318820534 Text en © The Author(s) 2019 http://www.creativecommons.org/licenses/by-nc/4.0/ This article is distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 License (http://www.creativecommons.org/licenses/by-nc/4.0/) which permits non-commercial use, reproduction and distribution of the work without further permission provided the original work is attributed as specified on the SAGE and Open Access pages (https://us.sagepub.com/en-us/nam/open-access-at-sage). |
spellingShingle | Algorithm development for evolutionary biological computation Avdeyev, Pavel Jiang, Shuai Alekseyev, Max A Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title | Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title_full | Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title_fullStr | Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title_full_unstemmed | Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title_short | Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model |
title_sort | linearization of median genomes under the double-cut-and-join-indel model |
topic | Algorithm development for evolutionary biological computation |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6557028/ https://www.ncbi.nlm.nih.gov/pubmed/31217687 http://dx.doi.org/10.1177/1176934318820534 |
work_keys_str_mv | AT avdeyevpavel linearizationofmediangenomesunderthedoublecutandjoinindelmodel AT jiangshuai linearizationofmediangenomesunderthedoublecutandjoinindelmodel AT alekseyevmaxa linearizationofmediangenomesunderthedoublecutandjoinindelmodel |