Chan, Ho Fai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 59-60). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.5 / Chapter 2 --- Current methods on Neighbor-Joining --- p.9 / Chapter 2.1 --- Introduction to graph theory --- p.9 / Chapter 2.2 --- General discussion on visualizing distance matrices by binary trees --- p.18 / Chapter 2.3 --- Original 0(N5) Neighbor-Joining algorithm --- p.21 / Chapter 2.4 --- Speedup of NJ --- p.22 / Chapter 2.4.1 --- 0(N3) NJ for arbitrary distance matrices --- p.23 / Chapter 2.4.2 --- 0(N2) NJ on additive matrices --- p.23 / Chapter 3 --- Finding neighbor pairs --- p.25 / Chapter 3.1 --- Properties of Binary trees --- p.25 / Chapter 3.2 --- Similar rows: finding all neighbor pairs in additive matrices --- p.28 / Chapter 4 --- Divide-and-Conquer Neighbor-Joining --- p.35 / Chapter 4.1 --- DCNJ Algorithm --- p.36 / Chapter 4.2 --- Theories of DCNJ on additive matrices: Correctness and Complexity --- p.44 / Chapter 5 --- Experimental Results --- p.56 / Chapter 6 --- Conclusions --- p.58
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_326473 |
| Date | January 2008 |
| Contributors | Chan, Ho Fai., Chinese University of Hong Kong Graduate School. Division of Mathematics. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, 60 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0021 seconds