Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JP6765040B2 - Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity - Google Patents
[go: Go Back, main page]

JP6765040B2 - Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity - Google Patents

Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity Download PDF

Info

Publication number
JP6765040B2
JP6765040B2 JP2016023214A JP2016023214A JP6765040B2 JP 6765040 B2 JP6765040 B2 JP 6765040B2 JP 2016023214 A JP2016023214 A JP 2016023214A JP 2016023214 A JP2016023214 A JP 2016023214A JP 6765040 B2 JP6765040 B2 JP 6765040B2
Authority
JP
Japan
Prior art keywords
data
dimensional structure
biomolecule
reconstructing
concept
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
JP2016023214A
Other languages
Japanese (ja)
Other versions
JP2017142633A (en
Inventor
祥人 平田
祥人 平田
有沙 小田
有沙 小田
邦史 太田
邦史 太田
合原 一幸
一幸 合原
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Tokyo NUC
Original Assignee
University of Tokyo NUC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Tokyo NUC filed Critical University of Tokyo NUC
Priority to JP2016023214A priority Critical patent/JP6765040B2/en
Priority to PCT/JP2017/004670 priority patent/WO2017138591A1/en
Publication of JP2017142633A publication Critical patent/JP2017142633A/en
Application granted granted Critical
Publication of JP6765040B2 publication Critical patent/JP6765040B2/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16BBIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B15/00ICT specially adapted for analysing two-dimensional [2D] or three-dimensional [3D] molecular structures, e.g. structural or functional relations or structure alignment
    • CCHEMISTRY; METALLURGY
    • C12BIOCHEMISTRY; BEER; SPIRITS; WINE; VINEGAR; MICROBIOLOGY; ENZYMOLOGY; MUTATION OR GENETIC ENGINEERING
    • C12NMICROORGANISMS OR ENZYMES; COMPOSITIONS THEREOF; PROPAGATING, PRESERVING, OR MAINTAINING MICROORGANISMS; MUTATION OR GENETIC ENGINEERING; CULTURE MEDIA
    • C12N15/00Mutation or genetic engineering; DNA or RNA concerning genetic engineering, vectors, e.g. plasmids, or their isolation, preparation or purification; Use of hosts therefor
    • C12N15/09Recombinant DNA-technology

Landscapes

  • Spectroscopy & Molecular Physics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Physics & Mathematics (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Biotechnology (AREA)
  • Biophysics (AREA)
  • Health & Medical Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • Chemical & Material Sciences (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Crystallography & Structural Chemistry (AREA)
  • Evolutionary Biology (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)

Description

本発明は、核酸やタンパク質をはじめとする生体分子の部分領域同士が3次元空間内で近いか否かの2値の情報から、生体分子データの3次元構造の再構成する生体分子データの3次元構造の再構成方法に関するものである。 In the present invention, 3 of biomolecule data for reconstructing the 3D structure of biomolecule data from binary information as to whether or not subregions of biomolecules such as nucleic acids and proteins are close to each other in 3D space. It relates to a method of reconstructing a three-dimensional structure.

DNAやRNAは、ヌクレオチドが2本鎖または1本鎖の鎖状に連なった高分子である。タンパク質は、アミノ酸が鎖状に連なった高分子である。 DNA and RNA are macromolecules in which nucleotides are linked in a double-stranded or single-stranded chain. A protein is a macromolecule in which amino acids are linked in a chain.

一般的に、DNAやRNA、タンパク質は細胞内で、核酸同士、タンパク質同士、または核酸とタンパク質の相互作用により、3次元構造を形成する。DNAやRNA、タンパク質の3次元構造は、それらの機能と密接に絡んでいると考えられ、生体機能や疾病を理解する上で重要な情報であると考えられる。 In general, DNA, RNA, and protein form a three-dimensional structure in a cell by nucleic acid-to-protein, protein-to-nucleic acid, or nucleic acid-protein interaction. The three-dimensional structures of DNA, RNA, and proteins are considered to be closely related to their functions, and are considered to be important information for understanding biological functions and diseases.

染色体の3次元構造の解析には、空間的に近接する配列を検出するchromosome conformation capture(3Cアッセイ)と呼ばれる実験手法が使われる。さらに、3Cは、空間的に近接する核酸断片情報をマイクロアレイや次世代シークエンサーを用いて網羅的に解析する4C、5C、Hi−Cなどの方法が開発されてきた。これらの細胞内での染色体間の空間的な距離を測るデータから、3次元構造を再構成するためには、部分配列間の3次元空間内での距離が近いか否かという情報がよく用いられる。しかし、現状では、3次元構造の再構成をするのに確率的な解析手法や、部分配列間の距離に関する補助的な情報を用いることが一般的となっている(下記非特許文献1、2参照)。 An experimental method called chromosome conformation certificate (3C assay) is used to analyze the three-dimensional structure of chromosomes by detecting spatially adjacent sequences. Furthermore, for 3C, methods such as 4C, 5C, and Hi-C have been developed for comprehensively analyzing information on nucleic acid fragments that are spatially close to each other using a microarray or a next-generation sequencer. From the data that measures the spatial distance between chromosomes in these cells, information on whether or not the distance between subsequences in the three-dimensional space is short is often used in order to reconstruct the three-dimensional structure. Be done. However, at present, it is common to use a probabilistic analysis method or auxiliary information on the distance between subsequences to reconstruct the three-dimensional structure (Non-Patent Documents 1 and 2 below). reference).

タンパク質や核酸の3次元構造解析には、X線結晶構造解析やクライオ電子顕微鏡法を用いた解析に加え, 核磁気共鳴(NMR)法により, 原子核の間の相互作用や原子の結合、電子状態をスペクトルとして検出する方法が用いられる。 For three-dimensional structural analysis of proteins and nucleic acids, in addition to analysis using X-ray crystal structure analysis and cryo-electron microscopy, nuclear magnetic resonance (NMR) method is used to interact between nuclei, bond atoms, and electronic states. Is used as a spectrum.

WO2009/084524WO2009 / 084524 WO2010/010675WO2010 / 01675

Marc A. Marti−Renom and Leonid A. Mirny, Bridging the resolution gap in structural modeling of 3D genome organization, PLoS Computational Biology 7, e1002125 (2011).Marc A. Marti-Renomm and Leonid A. Mirny, Brigging the resolution gap in strategy modeling of 3D genome organization, PLos12 Annick Lesne, Julien Riposo, Paul Roger, Axel Cournac, and Julien Mozziconacci, 3D genome reconstruction from chromosomal contacts, Nature Method 11, 1141−1143 (2014).Annik Lesne, Julien Riposo, Paul Roger, Axel Cournac, and Julien Mosiziconacci, 3D genome resonance from chromosome 14th.m.14 J. −P. Eckmann, S. O. Kamphorst, and D. Ruelle, Recurrence plots of dynamical systems, Europhysics Letters 4, 973−977 (1987).J.-P. Eckmann, S.O. Kamforst, and D. Ruelle, Recurrence plots of dynamic systems, Europhysics Letters 4, 973-977 (1987). N. Marwan, M. C. Romano, M. Thiel, andJ. Kurths, Recurrence plots for the analysis of complex systems, Physics Reports 438, 237−329 (2007).N. Marwan, MC Romano, M. Thiel, andJ. Kurths, Recurrence plots for the analysis of complex systems, Physics Reports 438, 2 Yoshito Hirata, Shunsuke Horai, and Kazuyuki Aihara, Reproduction of distance matrices and original time series from recurrence plots and their applications, European PhysicalJournal Special Topics 164, 13−22 (2008)Yoshito Hirata, Shunsuke Horai, and Kazuyuki Aihara, Reproduction of distance matrices and original time series from recurrence plots and their applications, European PhysicalJournal Special Topics 164, 13-22 (2008) 平田祥人, 合原一幸, 正規分布に従う乱数発生機構, 特願2009−548035, CPT/JP2008/073389, 特許4947476号.(アメリカ特許, Patent No. :US8,438,202B2, Date of Patent:May7, 2013)Yoshito Hirata, Kazuyuki Aihara, Random Number Generation Mechanism Following Normal Distribution, Japanese Patent Application No. 2009-548835, CPT / JP2008 / 073389, Patent No. 4947476. (US Patent, Patent No .: US8,438,202B2, Date of Patent: May7, 2013) 平田祥人, 合原一幸, 1つのシステムの受ける複数の外力の同時再構成方法及びその装置, CPT/ JP2009/ 003355.Yoshito Hirata, Kazuyuki Aihara, Simultaneous reconstruction method of multiple external forces received by one system and its device, CPT / JP2009 / 003355. Yoshito Hirata, Motomasa Komuro, Shunsuke Horai, and Kazuyuki Aihara, Faithfulness of recurrence plots:A mathematical proof, International Journal of Bifurcation and Chaos in press. volume 25,art.no.155168(2015)Yoshito Hirata, Motomasa Komuro, Shunsuke Horai, and Kazuyuki Aihara, Faithfulness of recurrence certificate plots: Mathematics no. 155168 (2015) E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269−271 (1959).E. W. Dijkstra, A note on two problems in context with graphs, Numericche Mathematics 1, 269-271 (1959). J. C. Gower, Some distance properties of latent root and vector methods used in multivariate analysis, Biometrika, 53, 325−338 (1966).J. C. Goer, Some distance properties of latent method and vector methods used in multivariate analysis, Biometrika, 53, 325-338 (1966). Masaaki Tanio, Yoshito Hirata, and Hideyuki Suzuki, Reconstruction of driving forces through recurrence plots, Physics Letters A 373, 2031−2040 (2009).Masaaki Tiano, Yoshito Hirata, and Hideyuki Suzuki, Reconstruction of driving forces stroke, physics9,Physics9, Physics Letters, Physics Letters Zhijun Duan, Mirela Andronescu, Kevin Schutz, Sean Mcllwain, Yoo Jung Kim, Choli Lee, Hay Shendure, Stanley Fields, C. Anthony Blau, and WilliamS. Noble, A three−dimensional model of the yeast genome, Nature 465, 363−367 (2010).Zhijun Duan, Mirela Andronescu, Kevin Schutz, Sean Mcllwain, Yoo Jung Kim, Choli Lee, Hay Shendure, Stanley Fields, C. Anthony Blau, and WilliamS. Noble, A three-dimensional model of the yeast genome, Nature 465, 363- 367 (2010).

そこで、本発明では、数理的な解析方法により、部分配列・部分領域間の距離が3次元空間内で近いかどうかという2値情報を用いて、核酸やタンパク質をはじめとする生体分子データの3次元構造を再構成する空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法を提案する(上記非特許文献3,4参照)。 Therefore, in the present invention, biomolecular data such as nucleic acids and proteins are 3 using binary information as to whether or not the distance between partial sequences and partial regions is close in a three-dimensional space by a mathematical analysis method. We propose a method for reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity to reconstruct the three-dimensional structure (see Non-Patent Documents 3 and 4 above).

本発明は、上記状況に鑑みて、DNAやRNAの部分配列同士が近いか否かの2値の情報から生体分子の3次元構造を再構成する、空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法を提供することを目的とする。 In view of the above situation, the present invention reconstructs a three-dimensional structure of a biomolecule from binary information on whether or not partial sequences of DNA or RNA are close to each other, and the present invention uses the concept of spatial proximity. It is an object of the present invention to provide a method for reconstructing a three-dimensional structure of molecular data.

本発明は、上記目的を達成するために、
〔1〕空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法であって、生体分子の一次配列を時間軸と見立てることにより、前記生体分子のHi−Cデータからリカレンスプロットを生成するステップと、前記リカレンスプロットの任意の2つの頂点間の距離を与える距離行列を生成するステップと、前記距離行列に対して多次元尺度構成法を用いて時系列データを再構成するステップと、再構成された前記時系列データから前記生体分子の3次元構造を再構成するステップとを含むことを特徴とする。
In order to achieve the above object, the present invention
[1] A method for reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity, from the Hi-C data of the biomolecule by regarding the primary sequence of the biomolecule as the time axis. A step to generate a recurrence plot, a step to generate a distance matrix that gives the distance between any two vertices of the recurrence plot, and time series data for the distance matrix using multidimensional scaling. It is characterized by including a step of reconstructing and a step of reconstructing the three-dimensional structure of the biomolecule from the reconstructed time-series data .

〔2〕上記〔1〕記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法において、前記生体分子が核酸であることを特徴とする。 [2] The method for reconstructing the three-dimensional structure of biomolecule data using the concept of spatial proximity described in [1] above is characterized in that the biomolecule is a nucleic acid.

〔3〕上記〔2〕記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法において、前記核酸がDNAやRNAであることを特徴とする。 [3] In the method for reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity described in [2] above, the nucleic acid is DNA or RNA.

〔4〕上記〔1〕記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法において、前記生体分子がタンパク質であることを特徴とする。 [4] The method for reconstructing the three-dimensional structure of biomolecule data using the concept of spatial proximity described in [1] above is characterized in that the biomolecule is a protein.

本発明によれば、以下のような効果を奏することができる。 According to the present invention, the following effects can be obtained.

従来法では、複数のもっともらしいモデルを推定するのに対し、本発明の方法は、確率的な方法ではなく、配列間の距離の再構成に基づく方法であるので、本発明の方法で再構成される3次元構造には一義性と再現性がある。その点で、本発明の方法は、既存の方法に比べて大きな利点がある。 While the conventional method estimates a plurality of plausible models, the method of the present invention is not a probabilistic method but a method based on the reconstruction of the distance between sequences. Therefore, the method of the present invention is used for reconstruction. The three-dimensional structure created has uniqueness and reproducibility. In that respect, the method of the present invention has a great advantage over the existing method.

本発明の概念図である。It is a conceptual diagram of this invention. 酵母の3次元構造の再構成を示す図である。It is a figure which shows the reconstruction of the three-dimensional structure of yeast. 図1の拡大図である。It is an enlarged view of FIG. 図4(a)はローレンツアトラクター、図4(b)はローレンツアトラクターのリカレンスプロットから原型を再構成した結果、図4(c)はローレンツアトラクターのリカレンスプロットにランダムに1%のエラーを加えてから原型を再構成した結果、図4(d)はローレンツアトラクターのリカレンスプロットから90%のデータを除き、原型を再構成した結果を示す図である。FIG. 4 (a) shows the Lorenz attractor, FIG. 4 (b) shows the recurrence plot of the Lorenz attractor, and FIG. 4 (c) shows the recurrence plot of the Lorenz attractor at random 1%. As a result of reconstructing the prototype after adding an error, FIG. 4D is a diagram showing the result of reconstructing the prototype by removing 90% of the data from the recurrence plot of the Lorenz attractor. 図5(a)はレスラーアトラクター、図5(b)はレスラーアトラクターのリカレンスプロットから原型を再構成した結果、図5(c)はレスラーアトラクターのリカレンスプロットにランダムに1%のエラーを加えてから原型を再構成した結果、図5(d)はレスラーアトラクターのリカレンスプロットから90%のデータを除き、原型を再構成した結果を示す図である。FIG. 5 (a) shows the wrestler attractor, FIG. 5 (b) shows the recurrence plot of the wrestler attractor, and FIG. 5 (c) shows the recurrence plot of the wrestler attractor at random 1%. As a result of reconstructing the prototype after adding an error, FIG. 5D is a diagram showing the result of reconstructing the prototype by removing 90% of the data from the recurrence plot of the wrestler attractor. マウスゲノムの再構成の例(染色体2番)を示す図である。It is a figure which shows the example (chromosome 2) of the rearrangement of a mouse genome.

本発明の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法は、生体分子内の任意の2つの分子領域同士、あるいは、配列同士が空間的に近いか否かの2値情報を利用して、2つの配列間の3次元空間内における距離を計算することで、生体分子の3次元構造を再構成する。 The method for reconstructing the three-dimensional structure of biomolecule data using the concept of spatial proximity of the present invention is whether or not any two molecular regions in the biomolecule or sequences are spatially close to each other. The three-dimensional structure of a biomolecule is reconstructed by calculating the distance between two sequences in a three-dimensional space using the binary information of.

以下、本発明の実施の形態について詳細に説明する。 Hereinafter, embodiments of the present invention will be described in detail.

リカレンスプロットは、元々は、時系列データを視覚化するための道具である。2次元の平面図で、縦軸、横軸とも同じ時間軸になっている。2つの時間点に対応する状態同士を比較し、その状態間の距離が近ければ、対応する場所に点を打ち、そうでなければ点を打たないとすることによって求めることができる。 The recurrence plot was originally a tool for visualizing time series data. In a two-dimensional plan view, both the vertical axis and the horizontal axis have the same time axis. It can be obtained by comparing the states corresponding to the two time points, and if the distance between the states is short, a point is placed at the corresponding place, and if not, no point is placed.

リカレンスプロットは、連続値の時系列データを距離が近いかどうかを示す2値の行列情報に変換してしまっているので、時系列データに関する情報がかなり落ちてしまっていると思われるかもしれない。確かに時系列の値の絶対値の情報は落ちてしまうのだが、リカレンスプロットから時系列データの概形が復元できることが知られている。特に、点が一様に分布している時、元の距離空間と同値な距離空間が再構成される(上記非特許文献5〜8参照)。 Since the recurrence plot has converted continuous time series data into binary matrix information indicating whether the distance is short, it may seem that the information about the time series data has dropped considerably. Absent. It is true that the absolute value information of the time series value is lost, but it is known that the outline of the time series data can be restored from the recurrence plot. In particular, when the points are uniformly distributed, a metric space equivalent to the original metric space is reconstructed (see Non-Patent Documents 5 to 8 above).

リカレンスプロットから元の時系列データの概形を復元するのは簡単である。まずは、リカレンスプロットをグラフだと見立てる。このグラフでは、リカレンスプロットの時間点が頂点になっていて、2つの時間点に対応する場所に点が打たれていれば、対応する頂点間を枝で結ぶ。この時、枝に次のような距離を割り当てる。 Restoring the outline of the original time series data from the Recurrence plot is easy. First, think of the Recurrence plot as a graph. In this graph, if the time point of the recurrence plot is the apex and the point is struck at the place corresponding to the two time points, the corresponding vertices are connected by a branch. At this time, the following distances are assigned to the branches.

1−|Gi ∩Gj |/|Gi ∪Gj | .
ここで、Gi はi行目のリカレンスプロットに打たれている点に対応する時間点の集合であり、|A|は集合Aの要素数を表す。次に、このグラフ上の任意の2つの頂点間の最短路を求める。これは、例えば、ダイクストラ法(上記非特許文献9参照)などを用いると簡単にできる。そして、任意の2つの頂点間の距離が与えられる距離行列を得る。この距離行列に対して、多次元尺度構成法を用いると、元の時系列データの概形を再現するような時系列データが再構成できる。
1- | G i ∩ G j | / | G i ∪ G j |.
Here, G i is a set of time points corresponding to the points struck by the recurrence plot on the i-th row, and | A | represents the number of elements in the set A. Next, the shortest path between any two vertices on this graph is found. This can be easily done by using, for example, the Dijkstra method (see Non-Patent Document 9 above). Then we get a distance matrix given the distance between any two vertices. By using the multidimensional scaling method for this distance matrix, time series data that reproduces the outline of the original time series data can be reconstructed.

ここで、生体高分子の一次配列を時間軸と見立てることで、リカレンスプロットに関する手法がそのまま核酸配列やアミノ酸配列に対しても応用できる。つまり、多次元尺度構成法(上記非特許文献10参照)を用いて再構成した時の上位3つの成分を見れば、DNAやRNA、タンパク質の3次元構造が求まる。 Here, by regarding the primary sequence of the biopolymer as the time axis, the method related to the recurrence plot can be directly applied to the nucleic acid sequence and the amino acid sequence. That is, the three-dimensional structures of DNA, RNA, and protein can be obtained by looking at the top three components when reconstructed using the multidimensional scaling method (see Non-Patent Document 10 above).

そこで、連続する配列が空間的に近いという情報を上記非特許文献11の手法を用い、対応するリカレンスプロットの中央の斜めの線を幅3以上の線のように太くすることで、必ず3次元構造が再構成できるような方法を構成できる。 Therefore, by using the method of Non-Patent Document 11 and thickening the diagonal line at the center of the corresponding recurrence plot as if it were a line with a width of 3 or more, the information that the continuous sequences are spatially close to each other is always 3 It is possible to construct a method in which the dimensional structure can be reconstructed.

図2は本発明の実施例を示す酵母の3次元構造の再構成を示す図であり、横軸は第1構成分子、横軸は第2構成分子である。図3は図1の拡大図であり、横軸は第1座標、横軸は第2座標である。また、×印でセントロメアの位置を示す。 FIG. 2 is a diagram showing a reconstruction of the three-dimensional structure of yeast showing an embodiment of the present invention, in which the horizontal axis is the first constituent molecule and the horizontal axis is the second constituent molecule. FIG. 3 is an enlarged view of FIG. 1, where the horizontal axis is the first coordinate and the horizontal axis is the second coordinate. In addition, the position of the centromere is indicated by a cross.

ここでは、上記非特許文献12で使用された酵母のデータを使って、本発明の方法を確かめた。ここでは、4つの別々の切断酵素を用いて求めたHi−Cのデータを統合して、3次元データの再構成を行った。Hi−Cのデータ解析における本発明の位置付けと、先行研究の概観を図1に示す。 Here, the method of the present invention was confirmed using the yeast data used in Non-Patent Document 12. Here, the Hi-C data obtained by using four separate cleavage enzymes were integrated to reconstruct the three-dimensional data. FIG. 1 shows the position of the present invention in Hi-C data analysis and an overview of previous studies.

結果を図2と図3に示す。図2では染色体1〜16番のうち、染色体12番を黒で、それ以外を灰色で図示した。黒で示した染色体12番上に位置するrDNAをコードするrDNA領域に大きなル−プが目立った。また、図3では黒のドットでセントロメアを図示したが、特に、セントロメア同士が近い場所にあることが分かる。実際、各染色体上からランダムに1点探してきて、最小木を求めるよりも、セントロメア同士の最小木を求めた時の方が、最小木を構成するのに必要なコストが小さくできる傾向にあることが分かった。このデータを得るのに用いられた出芽酵母ではセントロメアが凝集しやすいこと、rDNAが大きなループを作ることは先行研究においても示唆されており、本発明の方法の妥当性を伺わせる。 The results are shown in FIGS. 2 and 3. In FIG. 2, among chromosomes 1 to 16, chromosome 12 is shown in black, and the others are shown in gray. A large loop was conspicuous in the rDNA region encoding rDNA located on chromosome 12 shown in black. Further, in FIG. 3, the centromeres are illustrated by black dots, and it can be seen that the centromeres are particularly close to each other. In fact, the cost required to construct the minimum tree tends to be lower when the minimum tree between centromeres is found than when one point is randomly searched on each chromosome to find the minimum tree. It turned out. Previous studies have also suggested that centromeres tend to aggregate and rDNA forms large loops in the budding yeast used to obtain this data, suggesting the validity of the method of the present invention.

加えて、一般に転写や複製などの際には、核内でDNAと関連因子群が密集することが知られている。実際、本方法で再構成した染色体の空間を64000個の立方体に分割したところ、過半数の染色体が単一立方体内に密集して局在する場所が26個で見つかった。このため、本発明の方法は、転写ファクトリーや複製ファクトリーなどの機能ドメインの推定にも利用できる。 In addition, it is generally known that DNA and related factors are densely packed in the nucleus during transcription and replication. In fact, when the space of the chromosomes reconstructed by this method was divided into 64,000 cubes, 26 places where the majority of the chromosomes were densely localized in a single cube were found. Therefore, the method of the present invention can also be used to estimate functional domains such as transcription factories and replication factories.

また、本発明の利点として、ノイズの影響を受けにくいことが挙げられる。例えば、1%程度、空間的に近いかどうかという情報が誤っていたとしても、数値実験の例では、元の距離と再構成した距離の相関が0.70以上を保持している。生体内分子の近傍点を観測する実験データは、偽陽性のノイズを含んだり、全ての近傍点を網羅しきれないことが予想されるので、本発明が有効である。 Another advantage of the present invention is that it is not easily affected by noise. For example, even if the information about whether or not the distance is spatially close by about 1% is incorrect, in the example of the numerical experiment, the correlation between the original distance and the reconstructed distance is maintained at 0.70 or more. The present invention is effective because it is expected that the experimental data for observing the neighborhood points of the molecule in the living body contains false positive noise or cannot cover all the neighborhood points.

図4、図5の(a)〜(c)におもちゃモデルとして、ローレンツアトラクター、レスラーアトラクターの概形をリカレンスプロットから再構成した例と、さらに各リカレンスプロットに1%のノイズフリップを加えてから再構成をした結果を示す。 (A) to (c) of FIGS. 4 and 5 show an example in which the outlines of the Lorenz attractor and the wrestler attractor are reconstructed from the recurrence plot as toy models, and 1% noise flip on each recurrence plot. The result of the reconstruction after adding is shown.

さらに、本発明では、データの欠損に極めて強い。実際、おもちゃモデルでランダムに50%、90%のデータを欠損させて再構成の試行を行った所、欠損のないデータと比べてもそれぞれ、0.96,0.87以上の相関があった〔図4(d)、図5(d)〕。 Furthermore, the present invention is extremely resistant to data loss. In fact, when 50% and 90% of the data were randomly deleted in the toy model and the reconstruction was tried, there was a correlation of 0.96, 0.87 or more, respectively, compared with the data without the deletion. [FIG. 4 (d), FIG. 5 (d)].

現在一般に行われている1細胞レベルでの観測は技術的な検出感度の限界から、得られるデータが網羅性を欠いて粗であることが指摘されている。本発明はこのような生物データに対しても、優位性があると考えられる。 It has been pointed out that the data obtained are not comprehensive and coarse due to the technical limitation of detection sensitivity in the observation at the single cell level that is generally performed at present. The present invention is also considered to be superior to such biological data.

上記非特許文献2の方法では、1000点までは扱えるとされている。その一方で、図2、図3に示した例では11986点を扱っている。つまり、本発明の方が、より細かい解像度で大きなデータの3次元構造の再構成が可能である。本発明であれば、人やマウスの哺乳類ゲノムなどを含めサイズのデータを解像度を落とさずに扱うことも可能である。図6にマウスのゲノム再構成の例を示す。 It is said that the method of Non-Patent Document 2 can handle up to 1000 points. On the other hand, the examples shown in FIGS. 2 and 3 deal with 111986 points. That is, the present invention can reconstruct the three-dimensional structure of large data with finer resolution. According to the present invention, it is possible to handle size data including human and mouse mammalian genomes without reducing the resolution. FIG. 6 shows an example of mouse genome rearrangement.

図1、図2のデータの再構成に、2X2.66GHz6−Core Intel XeonのCPUと64GBのメモリを搭載したコンピュータ上で、MATLABで書かれたプログラムを使用して、約2日で計算を完了できる。 To reconstruct the data in FIGS. 1 and 2, the calculation is completed in about 2 days using a program written in MATLAB on a computer equipped with a 2X2.66GHz6-Core Intel Xeon CPU and 64GB of memory. it can.

従来法では、複数のもっともらしいモデルを推定するのに対し、本発明の方法は、確率的な方法ではなく、配列間の距離の再構成に基づく方法であるので、本発明の方法で再構成される3次元構造には一義性と再現性がある。その点で、本発明の方法は、従来の方法に比べて大きな利点がある。 While the conventional method estimates a plurality of plausible models, the method of the present invention is not a probabilistic method but a method based on the reconstruction of the distance between sequences. Therefore, the method of the present invention is used for reconstruction. The three-dimensional structure created has uniqueness and reproducibility. In that respect, the method of the present invention has a great advantage over the conventional method.

なお、本発明は上記実施例に限定されるものではなく、本発明の趣旨に基づき種々の変形が可能であり、これらを本発明の範囲から排除するものではない。 The present invention is not limited to the above examples, and various modifications can be made based on the gist of the present invention, and these are not excluded from the scope of the present invention.

本発明の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法は、確率的な方法ではなく、配列間の距離の再構成に基づく方法により、一義性と再現性をもたせて、空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法として利用可能である。 The method for reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity of the present invention is not a probabilistic method but a method based on the reconstruction of the distance between sequences, and is unique and reproducible. It can be used as a method for reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity.

Claims (4)

生体分子の一次配列を時間軸と見立てることにより、前記生体分子のHi−Cデータからリカレンスプロットを生成するステップと、
前記リカレンスプロットの任意の2つの頂点間の距離を与える距離行列を生成するステップと、
前記距離行列に対して多次元尺度構成法を用いて時系列データを再構成するステップと、
再構成された前記時系列データから前記生体分子の3次元構造を再構成するステップとを含むことを特徴とする空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法。
A step of generating a recurrence plot from Hi-C data of the biomolecule by regarding the primary sequence of the biomolecule as the time axis.
A step of generating a distance matrix that gives the distance between any two vertices of the recurrence plot,
Steps to reconstruct time series data using multidimensional scaling for the distance matrix,
A method for reconstructing a three-dimensional structure of biomolecule data using the concept of spatial proximity , which comprises a step of reconstructing the three-dimensional structure of the biomolecule from the reconstructed time-series data. ..
記生体分子が核酸である請求項1に記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法。 Reconstruction method of a three-dimensional structure of a biomolecule data using the concept of spatial proximity of claim 1 prior Symbol biomolecule is a nucleic acid. 記核酸がDNA又はRNAである請求項2に記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法。 Reconstruction method of a three-dimensional structure of a biomolecule data using the concept of spatial proximity of claim 2 before Symbol nucleic acid is DNA or RNA. 記生体分子がタンパク質である請求項1に記載の空間的な近さの概念を用いた生体分子データの3次元構造の再構成方法。 Reconstruction method of a three-dimensional structure of a biomolecule data using the concept of spatial proximity of claim 1 prior Symbol biomolecule is a protein.
JP2016023214A 2016-02-10 2016-02-10 Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity Expired - Fee Related JP6765040B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2016023214A JP6765040B2 (en) 2016-02-10 2016-02-10 Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity
PCT/JP2017/004670 WO2017138591A1 (en) 2016-02-10 2017-02-09 Biomolecular data three-dimensional structure reconstruction method using spatial closeness concept

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2016023214A JP6765040B2 (en) 2016-02-10 2016-02-10 Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity

Publications (2)

Publication Number Publication Date
JP2017142633A JP2017142633A (en) 2017-08-17
JP6765040B2 true JP6765040B2 (en) 2020-10-07

Family

ID=59563143

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2016023214A Expired - Fee Related JP6765040B2 (en) 2016-02-10 2016-02-10 Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity

Country Status (2)

Country Link
JP (1) JP6765040B2 (en)
WO (1) WO2017138591A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023048251A1 (en) * 2021-09-27 2023-03-30 国立大学法人筑波大学 Structure estimation program, structure estimation device, and structure estimation method

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113808661B (en) * 2021-09-18 2022-06-10 山东财经大学 Method and device for reconstructing three-dimensional structure of chromosome

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11232291A (en) * 1998-02-16 1999-08-27 Seibutsu Bunshi Kogaku Kenkyusho:Kk Search method for protein 3D structure database
JP2000319203A (en) * 1999-05-14 2000-11-21 Iyaku Bunshi Sekkei Kenkyusho:Kk How to create a three-dimensional structure of a compound
US8438202B2 (en) * 2007-12-27 2013-05-07 Japan Science And Technology Agency Mechanism for generating random numbers following normal distribution
JPWO2010010675A1 (en) * 2008-07-22 2012-01-05 独立行政法人科学技術振興機構 Method and apparatus for simultaneously reconfiguring multiple external forces received by one system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023048251A1 (en) * 2021-09-27 2023-03-30 国立大学法人筑波大学 Structure estimation program, structure estimation device, and structure estimation method

Also Published As

Publication number Publication date
JP2017142633A (en) 2017-08-17
WO2017138591A1 (en) 2017-08-17

Similar Documents

Publication Publication Date Title
Harris et al. Chromatin alternates between A and B compartments at kilobase scale for subgenic organization
Badia-i-Mompel et al. Gene regulatory network inference in the era of single-cell multi-omics
Oluwadare et al. An overview of methods for reconstructing 3-D chromosome and genome structures from Hi-C data
Jänes et al. Deep learning for protein structure prediction and design—progress and applications
Zhang et al. IsRNA1: de novo prediction and blind screening of RNA 3D structures
Liu et al. Network-based analysis of complex diseases
Huang et al. Weakly supervised learning of RNA modifications from low-resolution epitranscriptome data
Bottaro et al. RNA folding pathways in stop motion
CN103473482A (en) Protein three-dimensional structure prediction method based on differential evolution and conformation space annealing
JP6765040B2 (en) Method of reconstructing the three-dimensional structure of biomolecular data using the concept of spatial proximity
Liu et al. Reconstructing high-resolution chromosome three-dimensional structures by hi-C complex networks
Thomas et al. Overview of integrative analysis methods for heterogeneous data
Maurizio et al. Quantum computing for genomics: conceptual challenges and practical perspectives
Puigbò et al. Genome-wide comparative analysis of phylogenetic trees: the prokaryotic forest of life
Mabrouk et al. Different genomic signal processing methods for eukaryotic gene prediction: a systematic REVIEW
Shor et al. Integrative modeling meets deep learning: Recent advances in modeling protein assemblies
Puigbo et al. Genome-wide comparative analysis of phylogenetic trees: The prokaryotic forest of life
Wang et al. Priors in Bayesian phylogenetics
Chen et al. ClusterX: a novel representation learning-based deep clustering framework for accurate visual inspection in virtual screening
JPWO2023157933A5 (en)
Greenstreet et al. The dna-based global positioning system—a theoretical framework for large-scale spatial genomics
Zhukova et al. Efficiently analysing large viral data sets in computational phylogenomics
Zhu et al. Data Analysis in Single-Cell RNA-Seq
de Souza et al. 3D structural prediction, analysis and validation of Sars-Cov-2 protein molecules
Du Constructing Metagenome-Assembled Genomes and Mobile Genetic Element Host Interactions Using Metagenomic Hi-C

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20190212

RD03 Notification of appointment of power of attorney

Free format text: JAPANESE INTERMEDIATE CODE: A7423

Effective date: 20190314

A521 Request for written amendment filed

Free format text: JAPANESE INTERMEDIATE CODE: A821

Effective date: 20190314

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20200407

A601 Written request for extension of time

Free format text: JAPANESE INTERMEDIATE CODE: A601

Effective date: 20200605

A521 Request for written amendment filed

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20200703

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20200721

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20200817

R150 Certificate of patent or registration of utility model

Ref document number: 6765040

Country of ref document: JP

Free format text: JAPANESE INTERMEDIATE CODE: R150

LAPS Cancellation because of no payment of annual fees