Computing Robinson-Foulds supertree for two trees

Made available in DSpace on 2019-11-26T20:35:09Z (GMT). No. of bitstreams: 2 YU-THESIS-2019.pdf: 720940 bytes, checksum: 98f79d5c66de551f7b969ae6400fe54f (MD5) LICENSE.txt: 4205 bytes, checksum: 82c2b9e463c4f1a6ca91c6e1f16d7416 (MD5) Previous issue date: 2019-07-15

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2019

Author dc:creator

• Yu, Xilin

Contributors dc:contributor

• Warnow, Tandy

• Phylogeny estimation
• Supertree problem
• Robinson-Foulds Supertree
• Polynomial time algorithm
• NP-hardness
• Greedy heuristic
• Divide-and-conquer

Statement dc:rights

• This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/105698

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/105698