Table of Contents Author Guidelines Submit a Manuscript
BioMed Research International
Volume 2016 (2016), Article ID 4236858, 7 pages
http://dx.doi.org/10.1155/2016/4236858
Research Article

Constructing Phylogenetic Networks Based on the Isomorphism of Datasets

1School of Computer Science, Inner Mongolia University, Hohhot 010021, China
2Department of Information and Computer Engineering, Northeast Forestry University, Harbin 150040, China

Received 31 May 2016; Accepted 30 June 2016

Academic Editor: Yungang Xu

Copyright © 2016 Juan Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Q. Zou, Q. Hu, M. Guo, and G. Wang, “Halign: fast multiple similar DNA/RNA sequence alignment based on the centre star strategy,” Bioinformatics, vol. 31, no. 15, pp. 2475–2481, 2015. View at Publisher · View at Google Scholar · View at Scopus
  2. D. Mrozek, M. Brozek, and B. Małysiak-Mrozek, “Parallel implementation of 3D protein structure similarity searches using a GPU and the CUDA,” Journal of Molecular Modeling, vol. 20, no. 2, pp. 1–17, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Gusfield, D. Hickerson, and S. Eddhu, “An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study,” Discrete Applied Mathematics, vol. 155, no. 6-7, pp. 806–830, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. Q. Zou, X.-B. Li, W.-R. Jiang, Z.-Y. Lin, G.-L. Li, and K. Chen, “Survey of MapReduce frame operation in bioinformatics,” Briefings in Bioinformatics, vol. 15, no. 4, pp. 637–647, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. Y. Liu, X. Zeng, Z. He, and Q. Zou, “Inferring microRNA-disease associations by random walk on a heterogeneous network with multiple data sources,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2016. View at Publisher · View at Google Scholar
  6. D. H. Huson, R. Rupp, and C. Scornavacca, Phylogenetic Networks: Concepts, Algorithms and Applications, Cambridge University Press, New York, NY, USA, 2011.
  7. Q. Zou, Q. Hu, M. Guo, and G. Wang, “HAlign: fast multiple similar DNA/RNA sequence alignment based on the centre star strategy,” Bioinformatics, vol. 31, no. 15, pp. 2475–2481, 2015. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Wang, M.-Z. Guo, and L. L. Xing, “FastJoin, an improved neighbor-joining algorithm,” Genetics and Molecular Research, vol. 11, no. 3, pp. 1909–1922, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. Q. Zou, J. Zeng, L. Cao, and R. Ji, “A novel features ranking metric with application to scalable visual and bioinformatics data classification,” Neurocomputing, vol. 173, pp. 346–354, 2016. View at Publisher · View at Google Scholar · View at Scopus
  10. Q. Zou, J. Li, L. Song, X. Zeng, and G. Wang, “Similarity computation strategies in the microRNA-disease network: a survey,” Briefings in Functional Genomics, vol. 15, no. 1, pp. 55–64, 2016. View at Publisher · View at Google Scholar
  11. D. Bryant and V. Moulton, “Neighbor-net: an agglomerative method for the construction of phylogenetic networks,” Molecular Biology and Evolution, vol. 21, no. 2, pp. 255–265, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. D. H. Huson, T. Dezulian, T. Klopper, and M. A. Steel, “Phylogenetic super-networks from partial trees,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 1, no. 4, pp. 151–158, 2004. View at Publisher · View at Google Scholar
  13. D. H. Huson and T. H. Kloepper, “Computing recombination networks from binary sequences,” Bioinformatics, vol. 21, supplement 2, pp. ii159–ii165, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. L. van Iersel, S. Kelk, R. Rupp, and D. Huson, “Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters,” Bioinformatics, vol. 26, no. 12, pp. i124–i131, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Wu, “Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees,” Bioinformatics, vol. 26, no. 12, Article ID btq198, pp. i140–i148, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. D. H. Huson, R. Rupp, V. Berry, P. Gambette, and C. Paul, “Computing galled networks from real data,” Bioinformatics, vol. 25, no. 12, pp. i85–i93, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. D. H. Huson and R. Rupp, “Summarizing multiple gene trees using cluster networks,” in Algorithms in Bioinformatics, K. A. Crandall and J. Lagergren, Eds., vol. 5251, pp. 296–305, Springer, New York, NY, USA, 2008. View at Publisher · View at Google Scholar
  18. L. van Iersel, J. Keijsper, S. Kelk, L. Stougie, F. Hagen, and T. Boekhout, “Constructing level-2 phylogenetic networks from triplets, computational Biology and Bioinformatics,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. 4, pp. 667–681, 2009. View at Publisher · View at Google Scholar
  19. L. van Iersel and S. Kelk, “Constructing the simplest possible phylogenetic network from triplets,” Algorithmica, vol. 60, no. 2, pp. 207–235, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. J. Wang, “A new algorithm to construct phylogenetic networks from trees,” Genetics and Molecular Research, vol. 13, no. 1, pp. 1456–1464, 2014. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Mrozek, High-Performance Computational Solutions in Protein Bioinformatics, Springer Publishing Company, Incorporated, 2014.
  22. D. Mrozek, P. Gosk, and B. Małysiak-Mrozek, “Scaling Ab initio predictions of 3D protein structures in microsoft azure cloud,” Journal of Grid Computing, vol. 13, no. 4, pp. 561–585, 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. L. Van Iersel, S. Kelk, R. Rupp, and D. Huson, “Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters,” Bioinformatics, vol. 26, no. 12, Article ID btq202, pp. i124–i131, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. J. Wang, M. Guo, X. Liu et al., “Lnetwork: an efficient and effective method for constructing phylogenetic networks,” Bioinformatics, vol. 29, no. 18, pp. 2269–2276, 2013. View at Publisher · View at Google Scholar · View at Scopus
  25. J. Wang, M. Guo, L. Xing, K. Che, X. Liu, and C. Wang, “BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees,” Gene, vol. 527, no. 1, pp. 344–351, 2013. View at Publisher · View at Google Scholar · View at Scopus