Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms

doi:10.1145/1389095.1389152

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms

Full Text:

PDF

Buy this Article

Authors:	Sandro Pirkwieser	Vienna University of Technology, Vienna, Austria
	Günther R. Raidl	Vienna University of Technology, Vienna, Austria

Published in:

	· Proceeding
	GECCO '08 Proceedings of the 10th annual conference on Genetic and evolutionary computation
	ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-60558-130-9 doi>10.1145/1389095.1389152

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 5 · Downloads (12 Months): 17 · Citation Count: 0

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- GECCO '12

Tags: algorithms biology and genetics consensus tree problem constrained optimization hybrid methods memetic algorithm phylogenetics problem solving, control methods, and search variable neighborhood search

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player