
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ZhiZhong Chen, Lusheng Wang, "Algorithms for Reticulate Networks of Multiple Phylogenetic Trees," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 2, pp. 372384, March/April, 2012.  
BibTex  x  
@article{ 10.1109/TCBB.2011.137, author = {ZhiZhong Chen and Lusheng Wang}, title = {Algorithms for Reticulate Networks of Multiple Phylogenetic Trees}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {9}, number = {2}, issn = {15455963}, year = {2012}, pages = {372384}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.137}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Algorithms for Reticulate Networks of Multiple Phylogenetic Trees IS  2 SN  15455963 SP372 EP384 EPD  372384 A1  ZhiZhong Chen, A1  Lusheng Wang, PY  2012 KW  Phylogenetic trees KW  reticulate networks KW  lower bounds of reticulate numbers. VL  9 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] R.G. Beiko and N. Hamilton, “Phylogenetic Identification of Lateral Genetic Transfer Events,” BMC Evolutionary Biology, vol. 6, pp. 159169, 2006.
[2] M. Bordewich and C. Semple, “On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance,” Annals of Combinatorics, vol. 8, pp. 409423, 2005.
[3] M. Bordewich and C. Semple, “Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History,” Discrete Applied Math., vol. 155, pp. 914928, 2007.
[4] M. Bordewich and C. Semple, “Computing the Hybridization Number of Two Phylogenetic Trees Is FixedParameter Tractable,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 3, pp. 458466, July 2007.
[5] Z.Z. Chen and L. Wang, “HybridNet: A Tool for Constructing Hybridization Networks,” Bioinformatics, vol. 26, pp. 29122913, http://rnc.r.dendai.ac.jp/~chennotess2.pdf or http://www.cs.cityu.edu.hk/~lwang/software/ Hnnotess2.pdf), 2010.
[6] L. Collins, S. Linz, and C. Semple, “Quantifying Hybridization in Realistic Time,” J. Computational Biology, vol. 18, pp. 13051318, http://www.math.canterbury.ac.nz/~c.semple software.shtml], 2011.
[7] N.P. Barker et al., “Phylogeny and Subfamilial Classification of the Grasses (Poaceae),” Annals of the Missouri Botanical Garden, vol. 88, pp. 373457, 2001.
[8] J. Hein, T. Jing, L. Wang, and K. Zhang, “On the Complexity of Comparing Evolutionary Trees,” Discrete Applied Math., vol. 71, pp. 153169, 1996.
[9] T. Hill, K.J. Nordström, M. Thollesson, T.M. Säfström, A.K. Vernersson, R. Fredriksson, and H.B. Schiöth, “SPRIT: Identifying Horizontal Gene Transfer in Rooted Phylogenetic Trees,” BMC Evolutionary Biology, vol. 10, article 42, 2010.
[10] R. Hudson, “Generating Samples under the WrightFisher Neutral Model of Genetic Variation,” Bioinformatics, vol. 18, pp. 337338, 2002.
[11] H.A. Schmidt, “Phylogenetic Trees from Large Data Sets,” PhD thesis, HeinrichHeineUniversitat, Dusseldorf, 2003.
[12] B. Schieber and U. Vishkin, “On Finding Lowest Common Ancestors: Simplification and Parallelization,” SIAM J. Computing, vol. 17, pp. 12531262, 1988.
[13] C. Semple, “Reticulate Evolution,” http://www.lirmm.fr/MEP05/talk20_Semple.pdf , 2005.
[14] C. Semple, “Hybridization Networks,” Reconstructing Evolution: New Mathematical and Computational Advances, O. Gascuel and M. Steel, eds., pp. 277314, Oxford Univ. Press, 2007.
[15] J. Wang and Y. Wu, “Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees,” Proc. Int'l Symp. Bioinformatics Research and Applications (ISBRA '10), pp. 203214, 2010.
[16] C. Whidden, R.G. Beiko, and N. Zeh, “Fast FPT Algorithms for Computing Rooted Agreement Forest: Theory and Experiments,” Proc. Int'l Symp. Experimental Algorithms, pp. 141153, 2010.
[17] Y. Wu, “A Practical Method for Exact Computation of Subtree Prune and Regraft Distance,” Bioinformatics, vol. 25, pp. 190196, 2009.
[18] Y. Wu, “Close Lower and Upper Bounds for the Minimum Reticulate Network of Multiple Phylogenetic Trees,” Bioinformatics, vol. 26, pp. 140148, 2010.