Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.183, Iss.1, 2011-03, pp. : 75-94

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 8, Iss. 4, 2016-10 ,pp. : 55-77

IGI Global_journal

Access to resources Recommend Favorite

Generic Incremental Algorithms for Local Search

By Ågren Magnus Flener Pierre Pearson Justin

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 293-324

Springer Publishing Company

Access to resources Recommend Favorite

Programming cellular automata algorithms on parallel computers

By Spezzano G. Talia D.

Future Generation Computer Systems, Vol. 16, Iss. 2, 1999-12 ,pp. : 203-216

Elsevier

Access to resources Recommend Favorite

Parallel Formulations of Decision-Tree Classification Algorithms

By Srivastava Anurag Han Eui-Hong Kumar Vipin Singh Vineet

Data Mining and Knowledge Discovery, Vol. 3, Iss. 3, 1999-09 ,pp. : 237-261

Springer Publishing Company

Access to resources Recommend Favorite

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

By Bezenšek Mitja Robič Borut

International Journal of Parallel Programming, Vol. 42, Iss. 2, 2014-04 ,pp. : 287-319

Springer Publishing Company

Access to resources Recommend Favorite