MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees. MapReduce is a parallel framework that has been used effectively to design large-scale parallel applications for large computing clusters. In this paper, we evaluate the viability of the MapReduce framework for designing phylogenetic applications. The problem of interest is generating the all-to-all Robinson-Foulds distance matrix, which has many applications for visualizing and clustering large collections of evolutionary trees. We introduce MrsRF (MapReduce Speeds up RF), a multi-core algorithm to generate a t × t Robinson-Foulds distance matrix between t trees using the MapReduce paradigm.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Radenski, Atanas; Ehwerhemuepha, Louis: Speeding-up codon analysis on the cloud with local MapReduce aggregation (2014)
- Daugelaite, Jurate; O’Driscoll, Aisling; Sleator, Roy D.: An overview of multiple sequence alignments and cloud computing in bioinformatics (2013)
- Hong, Chun-Tao; Chen, De-Hao; Chen, Yu-Bei; Chen, Wen-Guang; Zheng, Wei-Min; Lin, Hai-Bo: Providing source code level portability between CPU and GPU with MapCG (2012)
- Matthews, Suzanne; Williams, Tiffani L.: Mrsrf: an efficient mapreduce algorithm for analyzing large collections of evolutionary trees (2010)