Go to main content

PDF

Description

This dissertation discusses how to write efficient, deterministic programs to infer phylogenetic trees. These programs are based on a theoretically optimal polynomial time algorithm. The programs are practical and efficient.

The problem is to infer phylogenetic trees from sequence data at the leaves. Likelihood approaches attempt to solve an NP-complete optimization problem, and are computationally intense.

Our approach is to apply efficient, polynomial time algorithms which are provably accurate to within a constant factor of optimal.

We present a program which is practical and computationally efficient.

Details

Title
A Minimum Spanning Tree Framework for Inferring Phylogenies
Creator
Adkins, Daniel Giannico, Author
EECS Department, University of California, Publisher
Published
2010-12-15
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2010-157
Type
Text
Format
technical reports
Extent
65 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
Collection

Files

Statistics

from
to
Export
Download Full History
Download
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket