Marc Hellmuth

Dr. Marc Hellmuth

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2012 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
MHMarc Hellmuth
Marc Hellmuth
MHMaribel Hernandez-Rosales
Maribel Hernandez-Rosales
KHKatharina T. Huber
Katharina T. Huber
VMVincent Moulton
Vincent Moulton
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
NWNicolas Wieseke
Nicolas Wieseke

30 January 2015 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
MHMarc Hellmuth
Marc Hellmuth
NWNicolas Wieseke
Nicolas Wieseke
MLMarcus Lechner
Marcus Lechner
HLHans-Peter Lenhof
Hans-Peter Lenhof
MMMartin Middendorf
Martin Middendorf
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Significance: We demonstrate that the distribution of paralogs in large gene families contains in itself sufficient phylogenetic signal to infer fully resolved species phylogenies. This source of phylogenetic information is independent of information contained in orthologous sequences and is resilient against horizontal gene transfer. An important consequence is that phylogenomics data sets need not be restricted to 1:1 orthologs.

30 November 2016 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
MHMarc Hellmuth
Marc Hellmuth
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
NWNicolas Wieseke
Nicolas Wieseke

19 December 2012 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MHMaribel Hernandez-Rosales
Maribel Hernandez-Rosales
MHMarc Hellmuth
Marc Hellmuth
NWNicolas Wieseke
Nicolas Wieseke
KHKatharina T Huber
Katharina T Huber
VMVincent Moulton
Vincent Moulton
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Tree reconciliation problems have long been studied in phylogenetics. A particular variant of the reconciliation problem for a gene tree T and a species tree S assumes that for each interior vertex x of T it is known whether x represents a speciation or a duplication. This problem appears in the context of analyzing orthology data. We show that S is a species tree for T if and only if S displays all rooted triples of T that have three distinct species as their leaves and are rooted in a speciation vertex. A valid reconciliation map can then be found in polynomial time. Simulated data shows that the event-labeled gene trees convey a large amount of information on underlying species trees, even for a large percentage of losses. The knowledge of event labels in a gene tree strongly constrains the possible species tree and, for a given species tree, also the possible reconciliation maps. Nevertheless, many degrees of freedom remain in the space of feasible solutions. In order to disambiguate the alternative solutions additional external constraints as well as optimization criteria could be employed.

27 June 2018 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
MGManuela Geiß
Manuela Geiß
JAJohn Anders
John Anders
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
NWNicolas Wieseke
Nicolas Wieseke
MHMarc Hellmuth
Marc Hellmuth

3 March 2017 in npj Systems Biology and Applications
Verified
Journal Article
Open access
PDF file
RBRicha Batra
Richa Batra
NANicolás Alcaraz
Nicolás Alcaraz
KGKevin Gitzhofer
Kevin Gitzhofer
JPJosch Pauling
Josch Pauling
HDHenrik Ditzel
Henrik Ditzel
MLMarkus List
Markus List
De novo pathway enrichment is a powerful approach to discover previously uncharacterized molecular mechanisms in addition to already known pathways. To achieve this, condition-specific functional modules are extracted from large interaction networks. Here, we give an overview of the state of the art and present the first framework for assessing the performance of existing methods. We identified 19 tools and selected seven representative candidates for a comparative analysis with more than 12,000 runs, spanning different biological networks, molecular profiles, and parameters. Our results show that none of the methods consistently outperforms the others. To mitigate this issue for biomedical researchers, we provide guidelines to choose the appropriate tool for a given dataset. Moreover, our framework is the first attempt for a quantitative evaluation of de novo methods, which will allow the bioinformatics community to objectively compare future tools against the state of the art.