NDLTD logo NDLTD Union Catalog and Global ETD Search

Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Supertree problem"”.

  1. Computing Robinson-Foulds supertree for two trees

    Yu, XilinUniversity of Illinois at Urbana-Champaign2019

    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

    uiuc Repository record