UPNT: Uniform Projection and Neighbourhood Thresholding method for motif discovery
by Jianxin Wang, De Yang
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 4, No. 1, 2008

Abstract: Motif discovery is a significant problem in Bioinformatics. According to the complexity of most signals in biologic sequences, there are no extremely good models or dependable algorithms to solve this problem. This paper introduces the Uniform Projection and Neighbourhood Thresholding (UPNT) algorithm, which is based on two efficient strategies: Uniform Projection and Neighbourhood-based Thresholding. In the UPNT algorithm, the policy of uniform projection leads to fewer projections, while the strategy of refining the buckets after aggregation results in great abatement of the number of buckets to be refined. This paper further demonstrates its superiority over other projection algorithms by the experiments.

Online publication date: Sun, 17-Feb-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com