Evidence map›Paper›PMID 30606105›Full record

ArticleBMC bioinformatics2019

DBS: a fast and informative segmentation algorithm for DNA copy number analysis.

Jun Ruan, Zhen Liu, Ming Sun, Yue Wang, Junqiu Yue, Guoqiang Yu

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.

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

14 citing papers in PubMed, 205 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. Article
  11. An Optimized Cloud Computing Method for Extracting Molecular Descriptors.Advances in experimental medicine and biology · 2023
    Article
  12. Review
  13. Identification of Copy Number Alterations from Next-Generation Sequencing Data.Advances in experimental medicine and biology · 2022
    Article
  14. An In Silico Method for Predicting Drug Synergy Based on Multitask Learning.Interdisciplinary sciences, computational life sciences · 2021
    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 3 institutions in 2 countries.

Jun RuanSchool of Information Engineering, Wuhan University of Technology, Wuhan, Hubei, 430070, China.
Zhen LiuSchool of Information Engineering, Wuhan University of Technology, Wuhan, Hubei, 430070, China.
Ming SunSchool of Information Engineering, Wuhan University of Technology, Wuhan, Hubei, 430070, China.
Yue WangDepartment of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Arlington, VA, 22203, USA.
Junqiu YueDepartment of Pathology, Hubei Cancer Hospital, Wuhan, Hubei, 430079, China.
Guoqiang YuDepartment of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Arlington, VA, 22203, USA. yug@vt.edu.
Wuhan University of Technology · CNVirginia Tech · USHubei Cancer Hospital · CN

Funding

National Health and Family Planning Commission of Wuhan City of China 2014(14)National Natural Science Foundation of China 81300042
6 · The paper itself

Abstract

backgroundGenome-wide DNA copy number changes are the hallmark events in the initiation and progression of cancers. Quantitative analysis of somatic copy number alterations (CNAs) has broad applications in cancer research. With the increasing capacity of high-throughput sequencing technologies, fast and efficient segmentation algorithms are required when characterizing high density CNAs data.

resultsA fast and informative segmentation algorithm, DBS (Deviation Binary Segmentation), is developed and discussed. The DBS method is based on the least absolute error principles and is inspired by the segmentation method rooted in the circular binary segmentation procedure. DBS uses point-by-point model calculation to ensure the accuracy of segmentation and combines a binary search algorithm with heuristics derived from the Central Limit Theorem. The DBS algorithm is very efficient requiring a computational complexity of O(n*log n), and is faster than its predecessors. Moreover, DBS measures the change-point amplitude of mean values of two adjacent segments at a breakpoint, where the significant degree of change-point amplitude is determined by the weighted average deviation at breakpoints. Accordingly, using the constructed binary tree of significant degree, DBS informs whether the results of segmentation are over- or under-segmented.

conclusionDBS is implemented in a platform-independent and open-source Java application (ToolSeg), including a graphical user interface and simulation data generation, as well as various segmentation methods in the native Java language.

Indexed as

AlgorithmsDNADNA Copy Number VariationsHigh-Throughput Nucleotide SequencingHumansDNA

Identifiers

PMID30606105
PMCPMC6318921
OpenAlexW2910124299

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.