324 search results - page 3 / 65 » Parallel implementation of a quartet-based algorithm for phy... |
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
TVLSI
2008
13 years 7 months ago
2008
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
SBACPAD
2003
IEEE
14 years 28 days ago
2003
IEEE
This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an i...
IPPS
2003
IEEE
14 years 28 days ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
CAIP
1995
Springer
13 years 11 months ago
1995
Springer
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...