Blog Archives

clusterProfiler in Bioconductor 2.8

March 26, 2011
By

In recently years, high-throughput experimental techniques such as microarray and mass spectrometry can identify many lists of genes and gene products. The most widely used strategy for high-throughput data analysis is to identify different gene clusters based on their expression profiles. Another commonly used approach is to annotate these genes to biological knowledge, such as Gene Ontology (GO) and...

Read more »

Machine Learning Ex2 – Linear Regression

March 22, 2011
By
Machine Learning Ex2 – Linear Regression

Thanks to this post, I found OpenClassroom. In addition, thanks to Andrew Ng and his lectures, I took my first course in machine learning. These videos are quite easy to follow. Exercise 2 requires implementing gradient descent algorithm to model data with linear regression.Read More: 243 Words Totally

Read more »

The easiest way to get UTR sequence

March 2, 2011
By

I just figure out the way to query UTR sequence from ensembl by biomart tool.It is very simple compare with using bioperl to parse gbk file to extract UTR sequence.Read More: 232 Words Totally

Read more »

The easiest way to get UTR sequence

March 2, 2011
By

I just figure out the way to query UTR sequences from ensembl by biomart tool.It is very simple compared with using bioperl to parse gbk files to extract UTR sequences.Read More: 236 Words Totally

Read more »

Estimate Probability and Quantile

January 25, 2011
By

Simple root finding and one dimensional integrals algorithms were implemented in previous posts.These algorithms can be used to estimate the cumulative probabilities and quantiles.Here, take normal distribution as an example.Read More: 281 Words Totally

Read more »

Estimate Probability and Quantile

January 25, 2011
By

Simple root finding and one dimensional integrals algorithms were implemented in previous posts.These algorithms can be used to estimate the cumulative probabilities and quantiles.Here, take normal distribution as an example.Read More: 281 Words Totally

Read more »

Single variable optimization

January 1, 2011
By

Optimization means to seek minima or maxima of a funtion within a given defined domain.If a function reach its maxima or minima, the derivative at that point is approaching to 0. If we apply Newton-Raphson method for root finding to f’, we can get the optimizing f.Read More: 223 Words Totally

Read more »

Single variable optimization

January 1, 2011
By

Optimization means to seek minima or maxima of a funtion within a given defined domain.If a function reach its maxima or minima, the derivative at that point is approaching to 0. If we apply Newton-Raphson method for root finding to f’, we can get the optimizing f.Read More: 223 Words Totally

Read more »

one-dimensional integrals

December 25, 2010
By
one-dimensional integrals

The foundamental idea of numerical integration is to estimate the area of the region in the xy-plane bounded by the graph of function f(x). The integral was esimated by divide x to small intervals, then add all the small approximations to give a total approximation.Read More: 468 Words Totally

Read more »

one-dimensional integrals

December 25, 2010
By
one-dimensional integrals

The foundamental idea of numerical integration is to estimate the area of the region in the xy-plane bounded by the graph of function f(x). The integral was esimated by divide x to small intervals, then add all the small approximations to give a total approximation.Read More: 468 Words Totally

Read more »