Marc Hellmuth
Marc Hellmuth
Stockholm University
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Phylogenomics with paralogs
M Hellmuth, N Wieseke, M Lechner, HP Lenhof, M Middendorf, PF Stadler
Proceedings of the National Academy of Sciences 112 (7), 2058-2063, 2015
Orthology relations, symbolic ultrametrics, and cographs
M Hellmuth, M Hernandez-Rosales, KT Huber, V Moulton, PF Stadler, ...
Journal of mathematical biology 66 (1-2), 399-420, 2013
From event-labeled gene trees to species trees
M Hernandez-Rosales, M Hellmuth, N Wieseke, KT Huber, V Moulton, ...
BMC Bioinformatics 13 (S19), S6, 2012
The mathematics of xenology: Di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
M Hellmuth, PF Stadler, N Wieseke
Journal of Mathematical Biology 75 (1), 199-237, 2017
From sequence data including orthologs, paralogs, and xenologs to gene and species trees
M Hellmuth, N Wieseke
Evolutionary Biology, 373-392, 2016
On the performance of de novo pathway enrichment
R Batra, N Alcaraz, K Gitzhofer, J Pauling, HJ Ditzel, M Hellmuth, ...
NPJ systems biology and applications 3 (1), 1-8, 2017
On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
M Hellmuth, N Wieseke
International Computing and Combinatorics Conference, 609-623, 2015
A survey on hypergraph products
M Hellmuth, L Ostermeier, PF Stadler
Mathematics in Computer Science 6 (1), 1-32, 2012
Approximate graph products
M Hellmuth, W Imrich, W Klöckl, PF Stadler
European Journal of Combinatorics 30 (5), 1119-1133, 2009
Reconstructing gene trees from Fitch’s xenology relation
M Geiß, J Anders, PF Stadler, N Wieseke, M Hellmuth
Journal of mathematical biology 77 (5), 1459-1491, 2018
Biologically feasible gene trees, reconciliation maps and informative triples
M Hellmuth
Algorithms for Molecular Biology 12 (1), 1-16, 2017
On tree representations of relations and graphs: Symbolic ultrametrics and cograph edge decompositions
M Hellmuth, N Wieseke
Journal of Combinatorial Optimization 36 (2), 591-616, 2018
Reciprocal best match graphs
M Geiß, PF Stadler, M Hellmuth
Journal of Mathematical Biology 80 (3), 865-953, 2020
Best match graphs
M Geiß, E Chávez, MG Laffitte, AL Sánchez, BMR Stadler, DI Valdivia, ...
Journal of mathematical biology 78 (7), 2015-2057, 2019
Time-consistent reconciliation maps and forbidden time travel
N Nøjgaard, M Geiß, D Merkle, PF Stadler, N Wieseke, M Hellmuth
Algorithms for Molecular Biology 13 (1), 1-17, 2018
Visualization of graph products
S Jänicke, C Heine, M Hellmuth, PF Stadler, G Scheuermann
IEEE Transactions on Visualization and Computer Graphics 16 (6), 1082-1089, 2010
A local prime factor decomposition algorithm
M Hellmuth
Discrete Mathematics 311 (12), 944-965, 2011
Local algorithms for the prime factorization of strong product graphs
M Hellmuth, W Imrich, W Klöckl, PF Stadler
Mathematics in Computer Science 2 (4), 653-682, 2009
The Cartesian product of hypergraphs
L Ostermeier, M Hellmuth, PF Stadler
Journal of Graph Theory 70 (2), 180-196, 2012
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
T Biyikoglu, M Hellmuth, J Leydold
Department of Statistics and Mathematics, WU Vienna University of Economics …, 2009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20