Reference-free prediction of rearrangement breakpoint reads

Edward Wijaya*, Kana Shimizu, Kiyoshi Asai, Michiaki Hamada


研究成果: Article査読

5 被引用数 (Scopus)


Availability and implementation: The source code of SlideSort-BPRcan be freely downloaded from

Motivation: Chromosome rearrangement events are triggered by atypical breaking and rejoining of DNA molecules, which are observed in many cancer-related diseases. The detection of rearrangement is typically done by using short reads generated by next-generation sequencing (NGS) and combining the reads with knowledge of a reference genome. Because structural variations and genomes differ from one person to another, intermediate comparison via a reference genome may lead to loss of information.

Results: In this article, we propose a reference-free method for detecting clusters of breakpoints from the chromosomal rearrangements. This is done by directly comparing a set of NGS normal reads with another set that may be rearranged. Our method SlideSort-BPR (breakpoint reads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100×, it finds ∼88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.

出版ステータスPublished - 2014 9 15

ASJC Scopus subject areas

  • 統計学および確率
  • 生化学
  • 分子生物学
  • コンピュータ サイエンスの応用
  • 計算理論と計算数学
  • 計算数学


「Reference-free prediction of rearrangement breakpoint reads」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。