Parallelizing the Phylogeny Problem

Abstract

The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. Drawing upon a technique known as character compatibility and an algorithm for a subproblem from Agarwala and Fernandez-Baca, modified according to a suggestion from Lawler, we present an algorithm and a proof of correctness. Based on experimental evidence, we have designed a highly-tuned sequential implementation. We also present an efficient parallel implementation based on a new distributed data structure.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1994
Accession Number
ADA637040

Entities

People

  • Jeff A. Jones

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • California
  • Classification
  • Computer Science
  • Computers
  • Contracts
  • Engineering
  • Information Operations
  • Instructions
  • Monitoring
  • Personality
  • Security
  • Standards

Readers

  • Operations Research
  • Parallel and Distributed Computing.
  • Vector-Borne Disease and Entomology