archives

A Faster Algorithm for the Perfect Phylogeny Problem when the Number of Characters is Fixed

Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Agarwala, Richa and Fernandez-Baca, David (1994) A Faster Algorithm for the Perfect Phylogeny Problem when the Number of Characters is Fixed. Technical Report TR94-05, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

A Faster Algorithm for the Perfect Phylogeny Problem
when the Number of Characters is Fixed
Richa Agarwala and David Fernandez-Baca
Abstract
We present an algorithm for determining whether a set of species, described by
the characters they exhibit, has a perfect phylogeny, assuming the maximum
number of characters is fixed.  This algorithm is simpler and faster than the
known algorithms when the number of characters is at least 4.




Subjects:All uncategorized technical reports



ID code:00000071


Deposited by:Staff Account on 23 March 1994









Contact site administrator at: ssg@cs.iastate.edu