
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Stephen J. Willson, "Regular Networks Can be Uniquely Constructed from Their Trees," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. 3, pp. 785796, May/June, 2011.  
BibTex  x  
@article{ 10.1109/TCBB.2010.69, author = {Stephen J. Willson}, title = {Regular Networks Can be Uniquely Constructed from Their Trees}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, number = {3}, issn = {15455963}, year = {2011}, pages = {785796}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.69}, 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  Regular Networks Can be Uniquely Constructed from Their Trees IS  3 SN  15455963 SP785 EP796 EPD  785796 A1  Stephen J. Willson, PY  2011 KW  Phylogeny KW  phylogenetic KW  network KW  tree KW  regular KW  hybrid. VL  8 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] L. Arvestad, A.C. Berglund, J. Lagergren, and B. Sennblad, "Gene Tree Reconstruction and Orthology Analysis Based on an Integrated Model for Duplications and Sequence Evolution," Proc. Eighth Ann. Int'l Conf. Resaerch in Computational Molecular Biology (RECOMB '04), pp. 326335, 2004.
[2] H.J. Bandelt and A. Dress, "Split Decomposition: A New and Useful Approach to Phylogenetic Analysis of Distance Data," Molecular Phylogenetics and Evolution, vol. 1, no. 3, pp. 242252, 1992.
[3] M. Baroni, C. Semple, and M. Steel, "A Framework for Representing Reticulate Evolution," Annals of Combinatorics, vol. 8, no. 4, pp. 391408, 2004.
[4] M. Baroni and M. Steel, "Accumulation Phylogenies," Annals of Combinatorics, vol. 10, no. 1, pp. 1930, 2006.
[5] M. Bordewich and C. Semple, "Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History," Discrete Applied Math., vol. 155, no. 8, pp. 914928, 2007.
[6] G. Cardona, F. Rossalló, and G. Valiente, "Comparison of TreeChild Phylogenetic Networks," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 6, no. 4, pp. 552569, Oct.Dec. 2009, doi:10.1109/TCBB.2007.70270.
[7] G. Cardona, L. Mercè, F. Rossalló, and G. Valiente, "A Distance Metric for a Class of TreeSibling Phylogenetic Networks," Bioinformatics, vol. 24, no. 13, pp. 14811488, 2008.
[8] J. Degnan and N. Rosenberg, "Discordance of Species Trees with Their Most Likely Gene Trees," PLoS Genetics vol. 2, no. 5e68, pp. 762768, 2006.
[9] D. Gusfield, S. Eddhu, and C. Langley, "Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination," J. Bioinformatics and Computational Biology, vol. 2, no. 1, pp. 173213, 2004.
[10] M. Hallett and J. Lagergren, "New Algorithms for the DuplicationLoss Model," Proc. Fourth Ann. Conf. Research in Computational Molecular Biology (RECOMB '00), pp. 138146, 2000.
[11] M. Hallett and J. Lagergren, "Efficient Algorithms for Lateral Gene Transfer Problems," Proc. Fifth Ann. Int'l Conf. Computational Biology, pp. 149156, 2001.
[12] B. Holland, K. Huber, V. Moulton, and P. Lockhart, "Using Consensus Networks to Visualize Contradictory Evidence for Species Phylogeny," Molecular Biology and Evolution vol. 21, no. 7, pp. 14591461, 2004.
[13] D. Huson, T. Klöpper, P. Lockhart, and M. Steel, "Reconstruction of Reticulate Networks from Gene Trees," Proc. Ninth Int'l Conf. Research in Computational Molecular Biology (RECOMB '05), S. Miyano, et al., eds., pp. 233249, 2005.
[14] D. Huson and T. Klöpper, "Beyond Galled Trees—Decomposition and Computation of Galled Networks," Proc. Ann. Conf. Research in Computational Molecular Biology (RECOMB '07), T. Speed and H. Huong, eds., pp. 211225, 2007.
[15] I. Kanj, L. Nakhleh, C. Than, and G. Xia, "Seeing the Trees and Their Branches in the Network is Hard," Theoretical Computer Science, vol. 401, nos. 13, pp. 153164, 2008.
[16] B. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme, "Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 1, pp. 1323, Jan.Mar. 2004.
[17] L. Nakhleh, T. Warnow, C.R. Linder, and K.S. John, "Reconstructing Reticulate Evolution in Species: Theory and Practice," J. Computational Biology, vol. 12, no. 6, pp. 796811, 2005.
[18] R.D.M. Page and M.A. Charleston, "Reconciled Trees and Incongruent Gene and Species Trees," Math. Hierarchies and Biology, B. Mirkin, F.R. McMorris, F.S. Roberts, and A. Rzhetsky, eds., pp. 5770, Am. Math. Soc., 1997.
[19] R.D.M. Page and M.A. Charleston, "From Gene to Organismal Phylogeny: Reconciled Trees and the Gene Tree/Species Tree Problem," Molecular Phylogenetics and Evolution, vol. 7, no. 2, pp. 231240, 1997.
[20] A. Rokas, B. Williams, N. King, and S. Carroll, "GenomeScale Approaches to Resolving Incongruence in Molecular Phylogenies," Nature, vol. 425, pp. 798804, 2003.
[21] N.A. Rosenberg, "The Probability of Topological Concordance of Gene Trees and Species Trees," Theoretical Population Biology, vol. 61, no. 2, pp. 225247, 2002.
[22] N.A. Rosenberg, "Counting Coalescent Histories," J. Computational Biology, vol. 14, no. 3, pp. 360377, 2007.
[23] K. Strimmer and V. Moulton, "Likelihood Analysis of Phylogenetic Networks Using Directed Graph Models," Molecular Biology and Evolution, vol. 17, no. 6, pp. 875881, 2000.
[24] L. Wang, K. Zhang, and L. Zhang, "Perfect Phylogenetic Networks with Recombination," J. Computational Biology, vol. 8, no. 1, pp. 6978, 2001.
[25] S.J. Willson, "Reconstruction of Certain Phylogenetic Networks from the Genomes at Their Leaves," J. Theoretical Biology, vol. 252, no. 2, pp. 338349, 2008.
[26] S.J. Willson, "Properties of Normal Phylogenetic Networks," Bull. of Math. Biology, vol. 72, no. 2, pp. 340358, 2010.