Evidence map›Paper›PMID 31217687›Full record

ArticleEvolutionary bioinformatics online2019

Linearization of Median Genomes Under the Double-Cut-and-Join-Indel Model.

Pavel Avdeyev, Shuai Jiang, Max A Alekseyev

Abstract read
In one paragraph

Article in Evolutionary bioinformatics online, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Pavel AvdeyevComputational Biology Institute, The George Washington University, Washington, DC, USA.
Shuai JiangDepartment of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA.
Max A AlekseyevComputational Biology Institute, The George Washington University, Washington, DC, USA.ORCID https://orcid.org/0000-0002-5140-8095

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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.

Indexed as

circular chromosomeDouble cut and joingenome median problemindels

Identifiers

PMID31217687
PMCPMC6557028

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.