Hybrids in real time

被引:77
作者
Baroni, M [1 ]
Semple, C [1 ]
Steel, M [1 ]
机构
[1] Univ Canterbury, Dept Math & Stat, Biomath Res Ctr, Christchurch, New Zealand
关键词
directed acyclic graph; reticulate evolution; hybrid species; subtree prune and regraft;
D O I
10.1080/10635150500431197
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
We describe some new and recent results that allow for the analysis and representation of reticulate evolution by nontree networks. In particular, we (1) present a simple result to show that, despite the presence of reticulation, there is always a well-defined underlying tree that corresponds to those parts of life that do not have a history of reticulation; (2) describe and apply new theory for determining the smallest number of hybridization events required to explain conflicting gene trees; and (3) present a new algorithm to determine whether an arbitrary rooted network can be realized by contemporaneous reticulation events. We illustrate these results with examples.
引用
收藏
页码:46 / 56
页数:11
相关论文
共 20 条
[1]   The number of recombination events in a sample history: Conflict graph and lower bounds [J].
Bafna, V ;
Bansal, V .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2004, 1 (02) :78-90
[2]  
Bang-Jensen J., 2001, DIGRAPHS THEORY ALGO
[3]   Bounding the number of hybridisation events for a consistent evolutionary history [J].
Baroni, M ;
Grünewald, S ;
Moulton, V ;
Semple, C .
JOURNAL OF MATHEMATICAL BIOLOGY, 2005, 51 (02) :171-182
[4]  
Baroni M., 2005, Ann Comb, V8, P391
[5]  
BARONI MC, 2004, THESIS U CANTERBURY
[6]  
BORDEWICH M, 2005, UCDMS200421
[7]  
Bordewich M., 2005, Ann Comb, V8, P409, DOI [DOI 10.1007/S00026-004-0229-Z, 10.1007/s00026-004-0229-z]
[8]  
Fisher F.J.F., 1965, ALPINE RANUNCULI NZ
[9]  
GUSFIELD D, 2004, CSE200432 UC DAV
[10]  
Gusfield Dan, 2004, J Bioinform Comput Biol, V2, P173, DOI 10.1142/S0219720004000521