Fast Algorithms for Inferring Evolutionary Trees

dc.contributor.author	Agarwala, Richa
dc.contributor.author	Fernández-Baca, David
dc.contributor.author	Slutzki, Giora
dc.contributor.department	Computer Science
dc.date	2018-02-13T22:03:27.000
dc.date.accessioned	2020-06-30T01:55:09Z
dc.date.available	2020-06-30T01:55:09Z
dc.date.issued	1992-07-03
dc.description.abstract	<p>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.</p>
dc.identifier	archive/lib.dr.iastate.edu/cs_techreports/12/
dc.identifier.articleid	1010
dc.identifier.contextkey	5230153
dc.identifier.s3bucket	isulib-bepress-aws-west
dc.identifier.submissionpath	cs_techreports/12
dc.identifier.uri	https://dr.lib.iastate.edu/handle/20.500.12876/19928
dc.source.bitstream	archive/lib.dr.iastate.edu/cs_techreports/12/TR92_19.pdf\|\|\|Fri Jan 14 19:03:51 UTC 2022
dc.subject.disciplines	Theory and Algorithms
dc.title	Fast Algorithms for Inferring Evolutionary Trees
dc.type	article
dc.type.genre	article
dspace.entity.type	Publication
relation.isOrgUnitOfPublication	f7be4eb9-d1d0-4081-859b-b15cee251456

Now showing 1 - 1 of 1