Fast Algorithms for Inferring Evolutionary Trees Agarwala, Richa Fernández-Baca, David Slutzki, Giora
dc.contributor.department Computer Science 2018-02-13T22:03:27.000 2020-06-30T01:55:09Z 2020-06-30T01:55:09Z 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/
dc.identifier.articleid 1010
dc.identifier.contextkey 5230153
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath cs_techreports/12
dc.source.bitstream archive/|||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
Original bundle
Now showing 1 - 1 of 1
196.14 KB
Adobe Portable Document Format