 |
 |
 |
 |
 |
 |
||
 |
 |
 |
 |
 |
| 32 | 1/1 | 返回列表 |
| 查看: 2375 | 回復(fù): 31 | ||
| 【獎(jiǎng)勵(lì)】 本帖被評價(jià)26次，作者1949stone增加金幣 20.6 個(gè) | ||
1949stone榮譽(yù)版主 (知名作家)
|
[資源]
Phylogenetic Networks：Concepts, Algorithms and Applications
|
|
|
Phylogenetic Networks：Concepts, Algorithms and Applications The evolutionary history of species is traditionally represented using a rooted phylogenetic tree. However, when reticulate events such as hybridization, horizontal gene transfer or recombination are believed to be involved, phylogenetic networks that can accommodate non-treelike evolution have an important role to play. This book provides the first interdisciplinary overview of phylogenetic networks. Beginning with a concise introduction to both phylogenetic trees and phylogenetic networks, the fundamental concepts and results are then presented for both rooted and unrooted phylogenetic networks. Current approaches and algorithms available for computing phylogenetic networks from different types of datasets are then discussed, accompanied by examples of their application to real biological datasets. The book also summarizes the algorithms used for drawing phylogenetic networks, along with the existing software for their computation and evaluation. All datasets, examples and other additional information and links are available fromthe book’s companion website at: www.phylogenetic-networks.org. Daniel H. Huson is Professor of Algorithms in Bioinformatics at T¨ubingenUniversity.He has authored numerous papers in bioinformatics, biology and mathematics, and is the main author of the widely used computer programs Dendroscope, MEGAN and SplitsTree. Regula Rupp received her PhD in Mathematics from Bern University in 2006. Between 2007 and 2009 she held a postdoctoral research position at T¨ubingen University, working with Daniel H. Huson in developing robust methods for computing phylogenetic networks from real biological data. Celine Scornavacca is a postdoctoral researcher working on algorithms for phylogenetic networks with Daniel H. Huson at T¨ubingen University. She received her PhD in Computer Science from Montpellier University in 2009. Preface page ix Part I Introduction 1 1 Basics 3 1.1 Overview 3 1.2 Undirected and directed graphs 3 1.3 Trees 7 1.4 Rooted DAGs 8 1.5 Traversals of trees and DAGs 9 1.6 Taxa, clusters, clades and splits 11 2 Sequence alignment 13 2.1 Overview 13 2.2 Pairwise sequence alignment 13 2.3 Multiple sequence alignment 20 3 Phylogenetic trees 23 3.1 Overview 23 3.2 Phylogenetic trees 24 3.3 The number of phylogenetic trees 27 3.4 Models of DNA evolution 29 3.5 The phylogenetic tree reconstruction problem 32 3.6 Sequence-based methods 33 3.7 Maximum parsimony 33 3.8 Branch-swapping methods 37 3.9 Maximum likelihood estimation 40 3.10 Bootstrap analysis 43 3.11 Bayesian methods 45 3.12 Distance-based methods 50 3.13 UPGMA 52 3.14 Neighbor-joining 54 3.15 Balanced minimum evolution 56 3.16 Comparing trees 60 3.17 Consensus trees 63 3.18 The Newick format 66 4 Introduction to phylogenetic networks 68 4.1 Overview 69 4.2 What is a phylogenetic network? 69 4.3 Unrooted phylogenetic networks 71 4.4 Rooted phylogenetic networks 76 4.5 The extended Newick format 81 4.6 Which types of networks are currently used in practice? 83 Part II Theory 85 5 Splits and unrooted phylogenetic networks 87 5.1 Overview 87 5.2 Splits 88 5.3 Compatibility and incompatibility 90 5.4 Splits and clusters 91 5.5 Split networks 93 5.6 The canonical split network 97 5.7 Circular splits and planar split networks 102 5.8 Weak compatibility 105 5.9 The split decomposition 107 5.10 Representing trees in a split network 121 5.11 Comparing split networks 122 5.12 T-theory 122 6 Clusters and rooted phylogenetic networks 127 6.1 Overview 127 6.2 Clusters, compatibility and incompatibility 128 6.3 Hasse diagrams 132 6.4 Cluster networks 133 6.5 Rooted phylogenetic networks 138 6.6 The lowest stable ancestor 140 6.7 Representing trees in rooted networks 144 6.8 Hardwired and softwired clusters 146 6.9 Minimum rooted phylogenetic networks 149 6.10 Decomposability 150 6.11 Topological constraints on rooted networks 156 6.12 Cluster containment in rooted networks 168 6.13 Tree containment 171 6.14 Comparing rooted networks 171 Part III Algorithms and applications 185 7 Phylogenetic networks from splits 187 7.1 The convex hull algorithm 187 7.2 The circular network algorithm 190 8 Phylogenetic networks from clusters 193 8.1 Cluster networks 193 8.2 Divide-and-conquer using decomposition 194 8.3 Galled trees 198 8.4 Galled networks 201 8.5 Level-k networks 210 9 Phylogenetic networks from sequences 216 9.1 Condensed alignments 216 9.2 Binary sequences and splits 216 9.3 Parsimony splits 218 9.4 Median networks 219 9.5 Quasi-median networks 223 9.6 Median-joining 227 9.7 Pruned quasi-median networks 232 9.8 Recombination networks 233 9.9 Galled trees 240 10 Phylogenetic networks from distances 250 10.1 Distances and splits 250 10.2 Minimum spanning networks 251 10.3 Split decomposition 251 10.4 Neighbor-net 254 10.5 T-Rex 261 11 Phylogenetic networks from trees 265 11.1 Consensus split networks 265 11.2 Consensus super split networks for unrooted trees 268 11.3 Distortion-filtered super split networks for unrooted trees 273 11.4 Consensus cluster networks for rooted trees 274 11.5 Minimum hybridization networks 275 11.6 Minimum hybridization networks and galled trees 285 11.7 Networks from multi-labeled trees 287 11.8 DLT reconciliation of gene and species trees 289 12 Phylogenetic networks from triples or quartets 300 12.1 Trees from rooted triples 300 12.2 Level-k networks from rooted triples 302 12.3 The quartet-net method 308 13 Drawing phylogenetic networks 312 13.1 Overview 312 13.2 Cladograms for rooted phylogenetic trees 312 13.3 Cladograms for rooted phylogenetic networks 316 13.4 Phylograms for rooted phylogenetic trees 323 13.5 Phylograms for rooted phylogenetic networks 324 13.6 Drawing rooted phylogenetic networks with transfer edges 327 13.7 Radial diagrams for unrooted trees 328 13.8 Radial diagrams for split networks 329 14 Software 332 14.1 SplitsTree 332 14.2 Network 333 14.3 TCS 334 14.4 Dendroscope 334 14.5 Other programs 335 Glossary 338 References 343 Index 358 [ Last edited by 1949stone on 2013-12-17 at 12:38 ] |
回復(fù)此樓» 本帖附件資源列表
-
歡迎監(jiān)督和反饋：小木蟲僅提供交流平臺，不對該內(nèi)容負(fù)責(zé)。
本內(nèi)容由用戶自主發(fā)布，如果其內(nèi)容涉及到知識產(chǎn)權(quán)問題，其責(zé)任在于用戶本人，如對版權(quán)有異議，請聯(lián)系郵箱：xiaomuchong@tal.com - 附件 1 : Phylogenetic_Networks.pdf
2013-12-17 12:33:29, 6.73 M
» 猜你喜歡
不合理蛙科研實(shí)驗(yàn)之小鼠實(shí)驗(yàn)：嚴(yán)謹(jǐn)設(shè)計(jì)，解析生命機(jī)制的重要載體
已經(jīng)有0人回復(fù)
-
不合理蛙科研實(shí)驗(yàn)之重金屬檢測：精準(zhǔn)篩查，守護(hù)健康與環(huán)境的防線
已經(jīng)有0人回復(fù)
-
化學(xué)工程及工業(yè)化學(xué)論文潤色/翻譯怎么收費(fèi)?
已經(jīng)有80人回復(fù)
-
不合理蛙科研實(shí)驗(yàn)之“蛙測重金屬我背鍋三千”
已經(jīng)有0人回復(fù)
-
不合理蛙科研實(shí)驗(yàn)之“鼠逃三次我發(fā)三篇SCI”
已經(jīng)有0人回復(fù)
-
納米粒度分析
已經(jīng)有3人回復(fù)
-
林科院林化所招收材料與化工專業(yè)碩士，坐標(biāo)南京
已經(jīng)有0人回復(fù)
-
留學(xué)--博士招生
已經(jīng)有16人回復(fù)
-
化學(xué)工程，本211，求調(diào)劑，ab區(qū)不限
已經(jīng)有4人回復(fù)
-
邵陽學(xué)院食品與化學(xué)工程學(xué)院碩士調(diào)劑
已經(jīng)有0人回復(fù)
15樓2014-09-22 16:42:30
19樓2015-01-15 22:29:41
1949stone
榮譽(yù)版主 (知名作家)
- MolEPI: 4
- 應(yīng)助: 95 (初中生)
- 貴賓: 2.38
- 金幣: 2633.7
- 帖子: 9831
- 在線: 2692.8小時(shí)
- 蟲號: 765987
20樓2015-01-15 22:30:34
23樓2015-03-21 09:58:57
29樓2018-02-07 11:36:43
31樓2021-04-26 16:14:31
簡單回復(fù)
jinhx872樓
2013-12-17 13:11
回復(fù)
五星好評 頂一下，感謝分享！
2013-12-17 16:06
回復(fù)
五星好評 頂一下，感謝分享！
gooo684樓
2013-12-17 16:46
回復(fù)
五星好評 
2013-12-18 06:42
回復(fù)
五星好評 頂一下，感謝分享！
loriy6樓
2013-12-18 09:30
回復(fù)
三星好評 頂一下，感謝分享！
2014-01-14 23:39
回復(fù)
五星好評 頂一下，感謝分享！
zkrahfy8樓
2014-02-06 14:34
回復(fù)
五星好評 頂一下，感謝分享！
小仙女38669樓
2014-04-05 15:45
回復(fù)
五星好評 頂一下，感謝分享！
yypcnbe10樓
2014-05-15 21:41
回復(fù)
五星好評 頂一下，感謝分享！
59730760711樓
2014-05-27 20:38
回復(fù)
五星好評 頂一下，感謝分享！
laqiwe12樓
2014-05-30 22:14
回復(fù)
五星好評 頂一下，感謝分享！
zkrahfy13樓
2014-07-13 21:53
回復(fù)
頂一下，感謝分享！
叢海燕14樓
2014-09-02 17:10
回復(fù)
五星好評 頂一下，感謝分享！
2014-10-02 17:19
回復(fù)
五星好評 頂一下，感謝分享！
紫霙17樓
2014-10-17 18:21
回復(fù)
五星好評 頂一下，感謝分享！
lauren18樓
2015-01-15 11:08
回復(fù)
五星好評 頂一下，感謝分享！
小平917521樓
2015-02-25 09:58
回復(fù)
五星好評 頂一下，感謝分享！
小平917522樓
2015-02-25 09:58
回復(fù)
感謝分享
2015-11-25 08:38
回復(fù)
頂一下，感謝分享！
dectab25樓
2015-12-02 14:13
回復(fù)
五星好評 頂一下，感謝分享！
liyueyue26樓
2016-02-21 17:35
回復(fù)
五星好評 頂一下，感謝分享！
來蘇兒27樓
2016-02-29 17:24
回復(fù)
五星好評 頂一下，感謝分享！
yan66628樓
2018-01-17 15:35
回復(fù)
ronghua432130樓
2019-11-24 21:49
回復(fù)
五星好評 頂一下，感謝分享！
D的小酒窩32樓
2024-06-19 21:53
回復(fù)
五星好評 頂一下，感謝分享！
相關(guān)版塊跳轉(zhuǎn)
我要訂閱樓主 1949stone 的主題更新
| 32 | 1/1 | 返回列表 |
| 最具人氣熱帖推薦 [查看全部] | 作者 | 回/看 | 最后發(fā)表 | |
|---|---|---|---|---|
|
[考研] 環(huán)境工程 085701，267求調(diào)劑 +5 | minht 2026-03-29 | 5/250 |
|
|---|---|---|---|---|
|
[考研] 調(diào)劑310 +10 | 溫柔的晚安 2026-03-25 | 11/550 |
|
|
|
[考研] 329求調(diào)劑 +10 | 鈕恩雪 2026-03-25 | 10/500 |
|
|
|
[考研] 356求調(diào)劑 +3 | gysy?s?a 2026-03-28 | 3/150 |
|
|
|
[考研] 數(shù)一英一271專碩（085401）求調(diào)劑，可跨 +7 | 前行必有光 2026-03-28 | 8/400 |
|
|
|
[考研] 283求調(diào)劑 +3 | A child 2026-03-28 | 3/150 |
|
|
|
[考研] 085602 化工專碩 338分 求調(diào)劑 +12 | 路癡小琪 2026-03-27 | 12/600 |
|
|
|
[考研] 一志愿北京工業(yè)大學(xué)，324分求調(diào)劑 +4 | 零八# 2026-03-28 | 4/200 |
|
|
|
[考研] 0703一志愿9，初試成績：338，四六級已過，有科研經(jīng)歷，求調(diào)劑！ +4 | Zuhui0306 2026-03-25 | 4/200 |
|
|
|
[考研] 調(diào)劑 +3 | 好好讀書。 2026-03-28 | 3/150 |
|
|
|
[考研] 085404求調(diào)劑，總分309，本科經(jīng)歷較為豐富 +4 | 來財(cái)aa 2026-03-25 | 4/200 |
|
|
|
[考研] 330一志愿中國海洋大學(xué) 化學(xué)工程 085602 有讀博意愿 求調(diào)劑 +3 | wywy.. 2026-03-27 | 4/200 |
|
|
|
[考研] 求調(diào)劑 +4 | 零八# 2026-03-27 | 4/200 |
|
|
|
[考研] 342求調(diào)劑 +3 | 加油a李zs 2026-03-26 | 3/150 |
|
|
|
[考研] 294分080500材料科學(xué)與工程求調(diào)劑 +4 | 柳溪邊 2026-03-26 | 4/200 |
|
|
|
[考研] 26考研-291分-廈門大學(xué)（085601）-柔性電子學(xué)院材料工程專業(yè)求調(diào)劑 +3 | min3 2026-03-24 | 4/200 |
|
|
|
[考研] 材料調(diào)劑 +3 | iwinso 2026-03-23 | 3/150 |
|
|
|
[考研] B區(qū)考研調(diào)劑 +4 | yqdszhdap－ 2026-03-22 | 5/250 |
|
|
|
[考研] 340求調(diào)劑 +5 | 話梅糖111 2026-03-24 | 5/250 |
|
|
|
[考研] 一志愿河北工業(yè)大學(xué)0817化工278分求調(diào)劑 +7 | jhybd 2026-03-23 | 12/600 |
|