000			03115nam a2200361 a 4500
005			20250918140441.0
008			110420s2011 enk b 001 0 eng
020			_a9780521755962 (hbk.) _cRM 165.70
039		9	_a201107191647 _bzaina _c201106210948 _didah _c201104201114 _didah _y04-20-2011 _zidah
040			_aUKM
090			_aQH83.H878
090			_aQH83 _b.H878
100	1		_aHuson, Daniel H.
245	1	0	_aPhylogenetic networks : _bconcepts, algorithms and applications / _cDaniel H. Huson, Regula Rupp, Celine Scornavacca.
260			_aCambridge : _bCambridge University Press, _c2011.
300			_axii, 362 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references and index.
520			_a'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 summarises 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 from the book's companion website at www.phylogenetic-networks.org'-- _cProvided by publisher.
520			_a'In the first part of this book we give an introduction to basic concepts from graph theory and systematics (Chapter 1). We briefly discuss the problem of aligning molecular sequences (Chapter 2) and give a more detailed introduction to the computation of phylogenetic trees from aligned sequences and distances (Chapter 3). Finally, we give a brief introduction to the computation of phyloge-netic networks, which also serves as an overview for the material presented in the second and third parts of the book (Chapter 4). Chapters 2 and 3 are provided for the sake of completeness and reference. They can be skipped by readers who have a basic knowledge of phylogenetic'-- _cProvided by publisher.
650		0	_aCladistic analysis _xData processing.
650		0	_aCladistic analysis _xMathematics.
650		0	_aPhylogeny.
700	1		_aRupp, Regula.
700	1		_aScornavacca, Celine.
856	4	2	_3Cover image _uhttp://assets.cambridge.org/97805217/55962/cover/9780521755962.jpg
907			_a.b15007054 _b2021-05-28 _c2019-11-12
942			_c01 _n0 _kQH83.H878
914			_avtls003462912
990			_azsz
991			_aFakulti Sains dan Teknologi
998			_at _b2011-07-04 _cm _da _feng _genk _y0 _z.b15007054
999			_c485467 _d485467