基于數(shù)字簽名與Trie的保序子矩陣約束查詢(xún)
發(fā)布時(shí)間:2018-11-02 19:16
【摘要】:目前,基因芯片技術(shù)飛速發(fā)展,促使生物學(xué)家積累了大量的不同實(shí)驗(yàn)條件下的基因表達(dá)數(shù)據(jù).事實(shí)證明,基因芯片數(shù)據(jù)分析在理解基因功能、基因調(diào)控和分子生命過(guò)程中發(fā)揮著重要作用.保序子矩陣(order-preserving submatrix,簡(jiǎn)稱(chēng)OPSM)是基因芯片數(shù)據(jù)分析技術(shù)中的一種有效模型,其可以發(fā)現(xiàn)在部分基因和不同實(shí)驗(yàn)條件下具有相同表達(dá)趨勢(shì)的聚類(lèi).在分析基因表達(dá)機(jī)理的過(guò)程中,OPSM的檢索無(wú)疑節(jié)省了生物學(xué)家的時(shí)間與精力.目前,OPSM的查詢(xún)主要是基于關(guān)鍵詞的檢索方法,但是分析者對(duì)結(jié)果具有微弱的控制力.通常,分析者所能決定的臨時(shí)的參數(shù)設(shè)置往往偏離其領(lǐng)域知識(shí),致使檢索結(jié)果與真實(shí)想要的結(jié)果相去甚遠(yuǎn).為了解決上述問(wèn)題,提出兩類(lèi)基于數(shù)字簽名與Trie的OPSM索引與約束查詢(xún)方法.在真實(shí)數(shù)據(jù)上進(jìn)行了大量的實(shí)驗(yàn),實(shí)驗(yàn)結(jié)果表明,所提出的方法具有良好的有效性與可擴(kuò)展性.
[Abstract]:At present, the rapid development of gene chip technology has prompted biologists to accumulate a large amount of gene expression data under different experimental conditions. It has been proved that gene chip data analysis plays an important role in understanding gene function, gene regulation and molecular life. Order-preserving submatrix, matrix (OPSM) is an effective model in gene chip data analysis. It can find clusters with the same expression trend in some genes and different experimental conditions. In the process of analyzing the mechanism of gene expression, the search of OPSM saves biologists' time and energy. At present, OPSM query is mainly based on keyword retrieval method, but analysts have weak control over the results. Usually, the temporary parameter settings that analysts can decide often deviate from their domain knowledge, so the retrieval results are far from the desired results. In order to solve the above problems, two kinds of OPSM indexing and constraint query methods based on digital signature and Trie are proposed. Experiments on real data show that the proposed method is effective and scalable.
【作者單位】: 西北工業(yè)大學(xué)計(jì)算機(jī)學(xué)院;
【基金】:國(guó)家重點(diǎn)基礎(chǔ)研究發(fā)展計(jì)劃(973)(2012CB316203) 國(guó)家自然科學(xué)基金(61033007,61272121,61332014,61572367,61472321,61502390) 國(guó)家高技術(shù)研究發(fā)展計(jì)劃(863)(2015AA015307) 中央高;究蒲袠I(yè)務(wù)費(fèi)專(zhuān)項(xiàng)資金(3102015JSJ0011) 西北工業(yè)大學(xué)研究生創(chuàng)業(yè)種子基金(Z2012128)~~
【分類(lèi)號(hào)】:TN918.91;TP311.13
本文編號(hào):2306712
[Abstract]:At present, the rapid development of gene chip technology has prompted biologists to accumulate a large amount of gene expression data under different experimental conditions. It has been proved that gene chip data analysis plays an important role in understanding gene function, gene regulation and molecular life. Order-preserving submatrix, matrix (OPSM) is an effective model in gene chip data analysis. It can find clusters with the same expression trend in some genes and different experimental conditions. In the process of analyzing the mechanism of gene expression, the search of OPSM saves biologists' time and energy. At present, OPSM query is mainly based on keyword retrieval method, but analysts have weak control over the results. Usually, the temporary parameter settings that analysts can decide often deviate from their domain knowledge, so the retrieval results are far from the desired results. In order to solve the above problems, two kinds of OPSM indexing and constraint query methods based on digital signature and Trie are proposed. Experiments on real data show that the proposed method is effective and scalable.
【作者單位】: 西北工業(yè)大學(xué)計(jì)算機(jī)學(xué)院;
【基金】:國(guó)家重點(diǎn)基礎(chǔ)研究發(fā)展計(jì)劃(973)(2012CB316203) 國(guó)家自然科學(xué)基金(61033007,61272121,61332014,61572367,61472321,61502390) 國(guó)家高技術(shù)研究發(fā)展計(jì)劃(863)(2015AA015307) 中央高;究蒲袠I(yè)務(wù)費(fèi)專(zhuān)項(xiàng)資金(3102015JSJ0011) 西北工業(yè)大學(xué)研究生創(chuàng)業(yè)種子基金(Z2012128)~~
【分類(lèi)號(hào)】:TN918.91;TP311.13
【相似文獻(xiàn)】
相關(guān)期刊論文 前5條
1 尚鳳軍;潘英俊;潘雪增;畢斌;;基于隨機(jī)分布的多比特Trie樹(shù)IP數(shù)據(jù)包分類(lèi)算法研究[J];通信學(xué)報(bào);2008年07期
2 華澤;馬濤;趙梅;;基于定位代碼和多分支Trie的快速多維數(shù)據(jù)包分類(lèi)[J];蘇州科技學(xué)院學(xué)報(bào);2006年02期
3 尚鳳軍,王海霞;基于跳轉(zhuǎn)表Trie樹(shù)的IP分類(lèi)算法[J];計(jì)算機(jī)工程;2004年24期
4 尚鳳軍;;一種IP數(shù)據(jù)包快速分類(lèi)算法[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年S1期
5 尚鳳軍,王海霞;基于完全無(wú)沖突哈希的IP數(shù)據(jù)包分類(lèi)算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2004年34期
,本文編號(hào):2306712
本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/2306712.html
最近更新
教材專(zhuān)著