基于数字签名与Trie的保序子矩阵约束查询

目前基因芯片技术飞速发展，促使生物学家积累了大量的在不同实验条件下的基因表达数据.事实证明基因芯片数据分析在理解基因功能、基因调控和分子生命过程中发挥着重要作用.保序子矩阵（OPSM）是基因芯片数据分析技术中一种有效的模型，其可以发现在部分基因和不同实验条件下具有相同表达趋势的聚类.在分析基因表达机理过程中，OPSM的检索无疑节省了生物学家的时间与精力.目前OPSM的查询主要是基于关键词的检索方法，但是分析者对结果具有微弱的控制力.通常分析者所能决定临时的参数设置往往偏离其领域知识，致使检索结果与真实想要结果相去甚远.为了解决上述问题，本文提出两类基于数字签名与Trie的OPSM索引与约束查询方法.在真实数据上进行了大量的实验，实验结果表明所提出方法具有良好的有效性与可扩展性.

Constrained Query of Order-Preserving Submatrix Based on Signature and Trie

The advances of microarray technology have made large amount of gene expression data available from a variety of different experimental conditions. Analyzing the microarray data plays a key role in understanding the gene functions, gene regulation and cellular process. Order-Preserving SubMatrix (OPSM) is an important model in microarray data analysis, which captures the identicaltendency of gene expressions across a subset of conditions. In the process of analyzing mechanism of gene expression, OPSM search undoubtedly saves the time and effort of biologists. However, OPSM retrievalmainly depends on keyword search, which has a weak control on the obtained clusters. Typically, the analyst can determine the ad-hoc parameters which are far from the declarative specification of desired properties on operation and concept. Motivated by given much more accurate query relevancy, the paper proposes twokinds ofOPSM indexing and constrained query methods based on signature and Trie. We conduct extensive experiments on real datasets, and the experimental results demonstrate the proposed methods have better behaviors than the state-of-the-art methods on efficiency and effectiveness.