東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Distance methods for phylogeny recon...

University of California, Berkeley.

FindBook

Google Book

Amazon

博客來

Distance methods for phylogeny reconstruction.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Distance methods for phylogeny reconstruction./
作者:	Mihaescu, Radu Horia.
面頁冊數:	138 p.
附註:	Advisers: Lior Pachter; Satish Rao.
Contained By:	Dissertation Abstracts International69-09B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3331708
ISBN:	9780549834779

Distance methods for phylogeny reconstruction.
Mihaescu, Radu Horia.

Distance methods for phylogeny reconstruction. - 138 p.

Advisers: Lior Pachter; Satish Rao.

Thesis (Ph.D.)--University of California, Berkeley, 2008.

Phylogenetics is the study of the evolutionary relationships between species. The present dissertation is concerned with the efficiency, accuracy and tractability of mathematical methods for recovering these relationships. We provide new algorithms for recovering the topology and branch lengths of the evolutionary tree, and provide reliability results for our own, as well as previous methods. We focus principally on distance methods, where the phylogeny is recovered from estimates of the pair-wise evolutionary distances between terminal species.

ISBN: 9780549834779Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Distance methods for phylogeny reconstruction.
LDR:03458nam 2200349 a 45 001 852720
005 20100630
008 100630s2008 ||||||||||||||||| ||eng d
020 $a 9780549834779
035 $a (UMI)AAI3331708
035 $a AAI3331708
040 $a UMI $c UMI
100 1 $a Mihaescu, Radu Horia. $3 1018724
245 1 0 $a Distance methods for phylogeny reconstruction.
300 $a 138 p.
500 $a Advisers: Lior Pachter; Satish Rao.
500 $a Source: Dissertation Abstracts International, Volume: 69-09, Section: B, page: 5452.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2008.
520 $a Phylogenetics is the study of the evolutionary relationships between species. The present dissertation is concerned with the efficiency, accuracy and tractability of mathematical methods for recovering these relationships. We provide new algorithms for recovering the topology and branch lengths of the evolutionary tree, and provide reliability results for our own, as well as previous methods. We focus principally on distance methods, where the phylogeny is recovered from estimates of the pair-wise evolutionary distances between terminal species.
520 $a For a known phylogenetic topology, we provide a way to recover weighted least squares edge lengths in optimal O(n 2) time, under a very general variance model. We generalize and unify many previous results under our framework of efficient computation of Lagrange multipliers. Our approach sheds much light on observed connections between WLS edge estimation and other popular algorithms for reconstructing phylogenetic topologies, most prominently the venerable and popular neighbor-joining (NJ).
520 $a New reliability bounds for NJ are presented in Chapter 3 by improving previous results and settling a famous and long-standing conjecture of Atteson concerning its error tolerance. Our results cast NJ as a robust "quartet consensus" method, explaining its surprising superiority over other such methods in practical applications. These results will also appear in [47].
520 $a When the input is not sufficiently reliable for full reconstruction, it is preferable to provide correct partial information, rather than an incorrect but fully specified tree. In [10] we presented the first practical algorithm for recovering "maximal", reliable, edge-disjoint partial sub-forests of the model tree, without making a priori assumptions on its edge lengths.
520 $a Here, we extend the above method by recovering genetic sequences of ancestral nodes. For trees with "short" edges, this can be done for arbitrarily deep nodes with bounded probability of error. Previous algorithms [12] show that for such trees, full topological reconstruction can be obtained from sequences of logarithmic length. We give an algorithm with asymptotically optimal running time and sequence length requirements, which reconstructs the full topology for arbitrarily deep short-edge trees, and otherwise returns a partial sub-forest. As in [10], we require no a-priori edge length assumptions and allow the user control over the probability of false positives.
590 $a School code: 0028.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Mathematics. $3 515831
650 4 $a Statistics. $3 517247
690 $a 0405
690 $a 0463
690 $a 0715
710 2 $a University of California, Berkeley. $3 687832
773 0 $t Dissertation Abstracts International $g 69-09B.
790 $a 0028
790 1 0 $a Pachter, Lior, $e advisor
790 1 0 $a Rao, Satish, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3331708