archives

Fast Algorithms for Inferring Evolutionary Trees


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Agarwala, Richa, Fernandez-Baca, David and Slutzki, Giora (1992) Fast Algorithms for Inferring Evolutionary Trees. Technical Report TR92-19, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

Fast Algorithms for Inferring Evolutionary Trees
by
Richa Agarwala, David Fernandez-Baca, and Giora Slutzki
We present algorithms for the perfect phylogeny problem restricted to
binary characters. The first algorithm is faster than a previous
algorithm by Gusfield when the input matrix for the problem is sparse.
Next, we present two online algorithms. For the first of these, the
characters are given as input one at a time, while, for the second, the
species are given as input one at a time. These two online algorithms
can easily be combined into an algorithm that can process any sequence
of additions and deletions of species and characters.

Subjects:All uncategorized technical reports
ID code:00000024
Deposited by:Staff Account on 06 July 1992



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