Difference between revisions of "RSPR"
| Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
| − | rSPR is a software package for calculating rooted subtree-prune-and-regraft distances and rooted agreement forests. | + | rSPR is a software package for calculating rooted subtree-prune-and-regraft distances and rooted agreement forests. Version 1.0.2 includes an implementation of the cluster reduction and is significantly faster than the previous versions in many cases. |
=== Documentation === | === Documentation === | ||
| Line 18: | Line 18: | ||
If you use rSPR in your research, please cite: | If you use rSPR in your research, please cite: | ||
| − | '''Whidden, C., Beiko, R.G., Zeh, N. ''Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments | + | '''Whidden, C., Zeh, N., Beiko, R.G. ''Subtree Prune-and-Regraft Supertrees''. 2011. |
| + | |||
| + | '''Whidden, C., Beiko, R.G., Zeh, N. ''Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments''. In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010. Lecture | ||
| + | Notes in Computer Science, vol. 6049, pp. 141–153. Springer-Verlag (2010)''' | ||
'''Whidden, C., Zeh, N. ''A Unifying View on Approximation and FPT of Agreement Forests''. In: WABI 2009. LNCS, vol. 5724, pp. 390–401. Springer-Verlag (2009)''' ([http://www.springerlink.com/content/n56q2846v645p655/ Abstract]) | '''Whidden, C., Zeh, N. ''A Unifying View on Approximation and FPT of Agreement Forests''. In: WABI 2009. LNCS, vol. 5724, pp. 390–401. Springer-Verlag (2009)''' ([http://www.springerlink.com/content/n56q2846v645p655/ Abstract]) | ||
| Line 27: | Line 30: | ||
== Funding == | == Funding == | ||
| − | |||
| − | |||
* [http://www.genomeatlantic.ca Genome Atlantic] | * [http://www.genomeatlantic.ca Genome Atlantic] | ||
* [http://www.nserc.ca The Natural Sciences and Engineering Research Council of Canada] | * [http://www.nserc.ca The Natural Sciences and Engineering Research Council of Canada] | ||
* The Dalhousie [http://cs.dal.ca Faculty of Computer Science] | * The Dalhousie [http://cs.dal.ca Faculty of Computer Science] | ||
| + | * [http://www.killamtrusts.ca/ The Killam Trusts] | ||
| + | * [http://www.innovation.ca/ The Canada Foundation for Innovation] | ||
| + | * [http://www.tula.org/ The Tula Foundation] | ||
Revision as of 18:56, 2 November 2011
rSPR is a software package for calculating rooted subtree-prune-and-regraft distances and rooted agreement forests. Version 1.0.2 includes an implementation of the cluster reduction and is significantly faster than the previous versions in many cases.
Documentation
Downloads
Examples
Citing rSPR
If you use rSPR in your research, please cite:
Whidden, C., Zeh, N., Beiko, R.G. Subtree Prune-and-Regraft Supertrees. 2011.
Whidden, C., Beiko, R.G., Zeh, N. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010. Lecture Notes in Computer Science, vol. 6049, pp. 141–153. Springer-Verlag (2010)
Whidden, C., Zeh, N. A Unifying View on Approximation and FPT of Agreement Forests. In: WABI 2009. LNCS, vol. 5724, pp. 390–401. Springer-Verlag (2009) (Abstract)
Contact Information
rSPR is in active development and we are interested in discussing all potential applications of this software. We encourage you to send us suggestions for new features. Suggestions, comments, and bug reports can be sent to Chris Whidden (whidden [at] cs.dal.ca). If reporting a bug, please provide as much information as possible and a simplified version of the data set which causes the bug. This will allow us to quickly resolve the issue.
