• 沒有找到結果。

Design and assessment of an algorithm that identifies specific probes for human and mouse genes

N/A
N/A
Protected

Academic year: 2022

Share "Design and assessment of an algorithm that identifies specific probes for human and mouse genes"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Design and assessment of an algorithm that identifies specific probes for human and mouse genes

作者: P. C. Chang;K. Peck

貢獻者: Department of Bioinformatics 日期: 2003

上傳時間: 2010-03-19T08:25:30Z 出版者: Asia University

摘要: Motivation: Mammalian genomes are highly complex. To identify the unique sequences of each gene in a mammalian gene database containing tens of thousands of DNA sequences is a computation intensive task. With the advent of parallel genetic analysis methods such as microarrays and the availability of more and more whole genome sequences of organisms, an algorithm allowing speedy identification of the unique gene probes for functional studies of individual genes will be a very useful tool.

Results: We have developed a fast algorithm as well as a software program based on the algorithm for identifying gene specific probes of complex organisms. The algorithm was applied to the assemblies of gene sequences and was highly efficient for large databases such as the TIGR human THC and mouse TC databases. The results were assessed with the BLAST sequence alignment software. Two probe data sets have been compiled to contain specific probes for around 100 000 putative human gene transcripts and 70 000 putative mouse gene transcripts.

參考文獻

相關文件

• makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution.. • not always yield optimal solution; may end up at

Textbook Chapter 33.4 – Finding the closest pair of points.. Closest Pair of

✓ Combining an optimal solution to the subproblem via greedy can arrive an optimal solution to the original problem. Prove that there is always an optimal solution to the

✓ Combining an optimal solution to the subproblem via greedy can arrive an optimal solution to the original problem.. Prove that there is always an optimal solution to the

Textbook Chapter 4.3 – The substitution method for solving recurrences Textbook Chapter 4.4 – The recursion-tree method for solving recurrences Textbook Chapter 4.5 – The master

Calculate the amortized cost of each operation based on the potential function 4. Calculate total amortized cost based on

jobs

Consistent with the negative price of systematic volatility risk found by the option pricing studies, we see lower average raw returns, CAPM alphas, and FF-3 alphas with higher