Exploring MapReduce for Large Collections of Phylogenetic Trees




[1] J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Sixth Symposium on Operating System Design and Implementation (OSDI '04), pages 137{150, 2004.

[2] S. J. Matthews and T. L. Williams. MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees. BMC Bioinformatics, 11(Suppl 1):S15, 2010.

[3] S. J. Matthews and T. L. Williams. An efficient and extensible approach for compressing phylogenetic trees. BMC Bioinformatics, 12(Suppl 10):S16, 2011.

[4] S. Muthukrishnan and G. Cormode. MapReduce and Mobile Algorithms. Internet website, last accessed, May 2013. Available at http://www.cs.rutgers.edu/~muthu/mapreduce_spr11.html.

[5] C. Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C. Kozyrakis. Evaluating MapReduce for multi-core and multiprocessor systems. In IEEE 13th International Symposium on High Performance Computer Architecture (HPCA'07), pages 13-24, Feb. 2007.

[6] D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53(1-2):131-147, 1981.

[7] S.-J. Sul, S. J. Matthews, and T. L. Williams. Using tree diversity to compare phylogenetic heuristics. BMC Bioinformatics, 10(Suppl 4):S3, 2009.