Benjamin Albrecht

Benjamin Albrecht. Computing Hybridization Networks Using Agreement Forests. PhD Thesis, Ludwig-Maximilians-Universität München, April 2016.

Benjamin Albrecht. Computing all hybridization networks for multiple binary phylogenetic input trees. BMC Bioinformatics, vol 16, no. 236, pp. 439-441, July 2015.

Benjamin Albrecht. Computing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests. arXiv:1408.3044, 2014.

Benjamin Albrecht, Volker Heun. Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. Ralf Klasing (ed.): Proceedings of the 11th International Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France, June 7-9, 2012, Lecture Notes in Computer Science, vol 7276, pp. 27-38, Springer Verlag, 2012.

Celine Scornavacca, Simone Linz, Benjamin Albrecht. A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. Journal of Computational Biology, vol 19, no. 11, pp. 1227-1242, November 2012.

Benjamin Albrecht, Celine Scornavacca, Alberto Cenci, Daniel H. Huson. Fast computation of minimum hybridization networks. Bioinformatics, vol 28, no. 2, pp. 191-197, 2011.

Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann. An Automatic Layout Algorithm for BPEL Processes. SoftVis '10: Proceedings of the 5th ACM Symposium on Software visualization, New York, NY, USA, ACM, October 2010.

Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler. Visualization of Complex BPEL Models. Proc. of the 17th International Symposium on Graph Drawing (GD '09), LNCS, 2010.