Evidence map›Paper›PMID 31131017›Full record

ArticleAlgorithms for molecular biology : AMB2019

Linear time minimum segmentation enables scalable founder reconstruction.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Algorithms for molecular biology : AMB, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing 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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. 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

4 authors.

Tuukka Norri1Department of Computer Science, University of Helsinki, Pietari Kalmin katu 5, 00014 Helsinki, Finland.
Bastien Cazaux1Department of Computer Science, University of Helsinki, Pietari Kalmin katu 5, 00014 Helsinki, Finland.
Dmitry Kosolobov2Ural Federal University, Mira 19, Yekaterinburg, 620002 Russia.
Veli Mäkinen1Department of Computer Science, University of Helsinki, Pietari Kalmin katu 5, 00014 Helsinki, Finland.ORCID 0000-0003-4454-1493

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundWe study a preprocessing routine relevant in pan-genomic analyses: consider a set of aligned haplotype sequences of complete human chromosomes. Due to the enormous size of such data, one would like to represent this input set with a few

resultsWe give an

conclusionsOur improvement enables to apply the formulation on an input of thousands of complete human chromosomes. We implemented the new algorithm and give experimental evidence on its practicality. The implementation is available in https://github.com/tsnorri/founder-sequences.

Indexed as

Dynamic programmingFounder reconstructionPan-genome indexingPositional Burrows–Wheeler transformRange minimum query

Identifiers

PMID31131017
PMCPMC6525415

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.