Evidence map›Paper›PMID 33253153›Full record

ArticlePLoS computational biology2020

Systematic clustering algorithm for chromatin accessibility data and its application to hematopoietic cells.

Azusa Tanaka, Yasuhiro Ishitsuka, Hiroki Ohta, Akihiro Fujimoto, Jun-Ichirou Yasunaga, Masao Matsuoka

Open access · goldAbstract read
In one paragraph

Article in PLoS computational biology, 2020. 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
0.2field-weighted citation impact, top 49% of its field
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, 7 citations in OpenAlex.

  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

6 authors at 2 institutions in 1 country.

Azusa TanakaDepartment of Human Genetics, Graduate School of Medicine, The University of Tokyo, Tokyo, Japan.ORCID 0000-0002-0503-4176
Yasuhiro IshitsukaCenter for Science Adventure and Collaborative Research Advancement, Graduate School of Science, Kyoto University, Kyoto, Japan.ORCID 0000-0002-4461-6152
Hiroki OhtaCenter for Science Adventure and Collaborative Research Advancement, Graduate School of Science, Kyoto University, Kyoto, Japan.ORCID 0000-0002-8815-9037
Akihiro FujimotoDepartment of Human Genetics, Graduate School of Medicine, The University of Tokyo, Tokyo, Japan.ORCID 0000-0002-0075-0800
Jun-Ichirou YasunagaLaboratory of Virus Control, Institute for Frontier Life and Medical Sciences, Kyoto University, Kyoto, Japan.ORCID 0000-0002-7939-2080
Masao MatsuokaLaboratory of Virus Control, Institute for Frontier Life and Medical Sciences, Kyoto University, Kyoto, Japan.ORCID 0000-0002-0473-754X
Kyoto University · JPThe University of Tokyo · JP

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The huge amount of data acquired by high-throughput sequencing requires data reduction for effective analysis. Here we give a clustering algorithm for genome-wide open chromatin data using a new data reduction method. This method regards the genome as a string of 1s and 0s based on a set of peaks and calculates the Hamming distances between the strings. This algorithm with the systematically optimized set of peaks enables us to quantitatively evaluate differences between samples of hematopoietic cells and classify cell types, potentially leading to a better understanding of leukemia pathogenesis.

Indexed as

AlgorithmsBone Marrow CellsChromatinCluster AnalysisHigh-Throughput Nucleotide SequencingHumansLeukemiaChromatin

Identifiers

PMID33253153
PMCPMC7728210
OpenAlexW3109959659

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.