A parallel approach to multiple sequences alignment and phylogenetic tree node labelling
by Jingjing Wang, Mengxia Zhu
International Journal of Computational Biology and Drug Design (IJCBDD), Vol. 3, No. 3, 2010

Abstract: An evolutionary tree represents the relationship among a group of species or sequences. The quality of tree topology relies heavily on an efficient Multiple Sequence Alignment (MSA). Efficient and parallel algorithms are designed to utilise the computing power and memory in a supercomputer. A divide and conquer based parallel algorithm is implemented to perform optimal three sequence alignment with much reduced memory cost. All internal nodes generated from a parallel Maximum Likelihood tree software are labelled using our level order based parallel approach. Such node labelling process is also parallelised to lead to a two-level nested parallel computing strategy.

Online publication date: Tue, 11-Jan-2011

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 Computational Biology and Drug Design (IJCBDD):
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