東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Planar phylogenetic network optimiza...

Phipps, Paul Thomas.

FindBook

Google Book

Amazon

博客來

Planar phylogenetic network optimization.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Planar phylogenetic network optimization./
作者:	Phipps, Paul Thomas.
面頁冊數:	103 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
Contained By:	Dissertation Abstracts International72-06B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450486
ISBN:	9781124591667

Planar phylogenetic network optimization.
Phipps, Paul Thomas.

Planar phylogenetic network optimization. - 103 p.

Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .

Thesis (Ph.D.)--The University of Texas at Dallas, 2011.

In recent years, phylogenetic networks have become important models for representing biological history and evolutionary relationships. Many algorithms for constructing these networks have been proposed and implemented. We focus our attention on those models that take, as input, a distance matrix representing dissimilarity among genetic sequences for sets of biological taxa. We characterize the circular split systems that can be realized with a planar network with a single internal face. We use the insight from this characterization to produce a heuristic algorithm that produces many fewer faces than do existing methods, on real biological data sets. We reinterpret the classic cases for networks with five or fewer taxa, and produce networks with fewer faces than networks in the past. We then develop an algorithm that realizes both circular splits and the K2n-2 metric, in a single planar network. Extensions to this algorithm are discussed.

ISBN: 9781124591667Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Planar phylogenetic network optimization.
LDR:02003nam 2200325 4500 001 1403052
005 20111108080403.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9781124591667
035 $a (UMI)AAI3450486
035 $a AAI3450486
040 $a UMI $c UMI
100 1 $a Phipps, Paul Thomas. $3 1682288
245 1 0 $a Planar phylogenetic network optimization.
300 $a 103 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
500 $a Adviser: Sergey Bereg.
502 $a Thesis (Ph.D.)--The University of Texas at Dallas, 2011.
520 $a In recent years, phylogenetic networks have become important models for representing biological history and evolutionary relationships. Many algorithms for constructing these networks have been proposed and implemented. We focus our attention on those models that take, as input, a distance matrix representing dissimilarity among genetic sequences for sets of biological taxa. We characterize the circular split systems that can be realized with a planar network with a single internal face. We use the insight from this characterization to produce a heuristic algorithm that produces many fewer faces than do existing methods, on real biological data sets. We reinterpret the classic cases for networks with five or fewer taxa, and produce networks with fewer faces than networks in the past. We then develop an algorithm that realizes both circular splits and the K2n-2 metric, in a single planar network. Extensions to this algorithm are discussed.
590 $a School code: 0382.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a The University of Texas at Dallas. $b Computer Science. $3 1682289
773 0 $t Dissertation Abstracts International $g 72-06B.
790 1 0 $a Bereg, Sergey, $e advisor
790 1 0 $a Bereg, Sergey $e committee member
790 1 0 $a Guo, Xiaohu $e committee member
790 1 0 $a Mittal, Neeraj $e committee member
790 1 0 $a Sudborough, Ivan H. $e committee member
790 $a 0382
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450486