Evidence map›Paper›PMID 21779396›Full record

ArticlePloS one2011

High resolution detection and analysis of CpG dinucleotides methylation using MBD-Seq technology.

Xun Lan, Christopher Adams, Mark Landers, Miroslav Dudas, Daniel Krissinger, George Marnellos, Russell Bonneville, Maoxiong Xu, Junbai Wang, Tim H-M Huang and 2 more

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 45 papers.

0numbers the graph read from it
0cells of the map it votes in
45citing papers in PubMed
3.7field-weighted citation impact, top 6% 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

45 citing papers in PubMed, 78 citations in OpenAlex.

  1. Review
  2. Article
  3. Review
  4. Article
  5. Review
  6. Article
  7. Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Methylation analyses in liquid biopsy.Translational lung cancer research · 2016
    Review
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

12 authors at 2 institutions in 2 countries.

Xun LanDepartment of Biomedical Informatics, The Ohio State University, Columbus, Ohio, United States of America.
Christopher Adams
Mark Landers
Miroslav Dudas
Daniel Krissinger
George Marnellos
Russell Bonneville
Maoxiong Xu
Junbai Wang
Tim H-M Huang
Gavin Meredith
Victor X Jin
The Ohio State University · USOslo University Hospital · NO

Funding

Howard Hughes Medical Institute
6 · The paper itself

Abstract

Methyl-CpG binding domain protein sequencing (MBD-seq) is widely used to survey DNA methylation patterns. However, the optimal experimental parameters for MBD-seq remain unclear and the data analysis remains challenging. In this study, we generated high depth MBD-seq data in MCF-7 cell and developed a bi-asymmetric-Laplace model (BALM) to perform data analysis. We found that optimal efficiency of MBD-seq experiments was achieved by sequencing ∼100 million unique mapped tags from a combination of 500 mM and 1000 mM salt concentration elution in MCF-7 cells. Clonal bisulfite sequencing results showed that the methylation status of each CpG dinucleotides in the tested regions was accurately detected with high resolution using the proposed model. These results demonstrated the combination of MBD-seq and BALM could serve as a useful tool to investigate DNA methylome due to its low cost, high specificity, efficiency and resolution.

Indexed as

Cell LineDinucleoside PhosphatesDNA MethylationHumansModels, BiologicalMolecular BiologyCpG dinucleotideDinucleoside Phosphates

Identifiers

PMID21779396
PMCPMC3136941
OpenAlexW2158698794

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.