Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
by G.V.R. Viana, F.A.C. Gomes, C.E. Ferreira, C.N. Meneses
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 5, No. 2, 2009

Abstract: In this work we study a phylogeny problem. That is, given a collection of organisms, we want to reconstruct the evolutionary history of the organisms. We are interested in inferring relationships between the organisms. For a number of reasonable biological hypotheses the problem becomes NP-hard. Besides that, the problem data is large enough to inhibit anyone using exact algorithms to solve, in practical computational time, real instances of the problem. In this work, we propose an innovative technique based on local search procedures that use multiple starts and diversified neighbourhoods.

Online publication date: Tue, 24-Mar-2009

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