| Year |
Citation |
Score |
| 2024 |
Hellmuth M, Stadler PF. The Theory of Gene Family Histories. Methods in Molecular Biology (Clifton, N.J.). 2802: 1-32. PMID 38819554 DOI: 10.1007/978-1-0716-3838-5_1 |
0.476 |
|
| 2023 |
Schaller D, Hartmann T, Lafond M, Stadler PF, Wieseke N, Hellmuth M. Relative timing information and orthology in evolutionary scenarios. Algorithms For Molecular Biology : Amb. 18: 16. PMID 37940998 DOI: 10.1186/s13015-023-00240-4 |
0.6 |
|
| 2023 |
Hellmuth M, Schaller D, Stadler PF. Clustering systems of phylogenetic networks. Theory in Biosciences = Theorie in Den Biowissenschaften. PMID 37573261 DOI: 10.1007/s12064-023-00398-w |
0.409 |
|
| 2022 |
Schaller D, Geiss M, Hellmuth M, Stadler PF. Best Match Graphs with Binary Trees. Ieee/Acm Transactions On Computational Biology and Bioinformatics. PMID 35044918 DOI: 10.1109/TCBB.2022.3143870 |
0.645 |
|
| 2021 |
Schaller D, Hellmuth M, Stadler PF. A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set. Algorithms For Molecular Biology : Amb. 16: 23. PMID 34872590 DOI: 10.1186/s13015-021-00202-8 |
0.479 |
|
| 2021 |
Schaller D, Geiß M, Hellmuth M, Stadler PF. Heuristic algorithms for best match graph editing. Algorithms For Molecular Biology : Amb. 16: 19. PMID 34404422 DOI: 10.1186/s13015-021-00196-3 |
0.607 |
|
| 2021 |
Schaller D, Lafond M, Stadler PF, Wieseke N, Hellmuth M. Indirect identification of horizontal gene transfer. Journal of Mathematical Biology. 83: 10. PMID 34218334 DOI: 10.1007/s00285-021-01631-0 |
0.652 |
|
| 2021 |
Schaller D, Geiß M, Chávez E, González Laffitte M, López Sánchez A, Stadler BMR, Valdivia DI, Hellmuth M, Hernández Rosales M, Stadler PF. Corrigendum to "Best match graphs". Journal of Mathematical Biology. 82: 47. PMID 33818665 DOI: 10.1007/s00285-021-01601-6 |
0.562 |
|
| 2021 |
Schaller D, Geiß M, Stadler PF, Hellmuth M. Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. Journal of Mathematical Biology. 82: 20. PMID 33606106 DOI: 10.1007/s00285-021-01564-8 |
0.637 |
|
| 2020 |
Lafond M, Hellmuth M. Reconstruction of time-consistent species trees. Algorithms For Molecular Biology : Amb. 15: 16. PMID 32843891 DOI: 10.1186/S13015-020-00175-0 |
0.473 |
|
| 2020 |
Flamm C, Hellmuth M, Merkle D, Nojgaard N, Stadler PF. Generic Context-Aware Group Contributions. Ieee/Acm Transactions On Computational Biology and Bioinformatics. PMID 32750852 DOI: 10.1109/Tcbb.2020.2998948 |
0.452 |
|
| 2020 |
Stadler PF, Geiß M, Schaller D, López Sánchez A, González Laffitte M, Valdivia DI, Hellmuth M, Hernández Rosales M. From pairs of most similar sequences to phylogenetic best matches. Algorithms For Molecular Biology : Amb. 15: 5. PMID 32308731 DOI: 10.1186/S13015-020-00165-2 |
0.51 |
|
| 2020 |
Geiß M, Laffitte MEG, Sánchez AL, Valdivia DI, Hellmuth M, Rosales MH, Stadler PF. Best match graphs and reconciliation of gene trees with species trees. Journal of Mathematical Biology. PMID 32002659 DOI: 10.1007/S00285-020-01469-Y |
0.665 |
|
| 2020 |
Fritz A, Hellmuth M, Stadler PF, Wieseke N. Cograph editing: Merging modules is equivalent to editing P_4s The Art of Discrete and Applied Mathematics. 3: #P2.01. DOI: 10.26493/2590-9770.1252.e71 |
0.304 |
|
| 2020 |
Hellmuth M, Geiß M, Stadler PF. Complexity of modification problems for reciprocal best match graphs Theoretical Computer Science. 809: 384-393. DOI: 10.1016/J.Tcs.2019.12.033 |
0.658 |
|
| 2020 |
Hellmuth M, Seemann CR, Stadler PF. Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees Discrete Applied Mathematics. 283: 495-511. DOI: 10.1016/J.Dam.2020.01.036 |
0.542 |
|
| 2019 |
Geiß M, Stadler PF, Hellmuth M. Reciprocal best match graphs. Journal of Mathematical Biology. PMID 31691135 DOI: 10.1007/S00285-019-01444-2 |
0.665 |
|
| 2019 |
Hellmuth M, Huber KT, Moulton V. Reconciling event-labeled gene trees with MUL-trees and species networks. Journal of Mathematical Biology. PMID 31410552 DOI: 10.1007/S00285-019-01414-8 |
0.445 |
|
| 2019 |
Hellmuth M, Seemann CR. Alternative characterizations of Fitch's xenology relation. Journal of Mathematical Biology. PMID 31111195 DOI: 10.1007/S00285-019-01384-X |
0.413 |
|
| 2019 |
Geiß M, Chávez E, González Laffitte M, López Sánchez A, Stadler BMR, Valdivia DI, Hellmuth M, Hernández Rosales M, Stadler PF. Best match graphs. Journal of Mathematical Biology. PMID 30968198 DOI: 10.1007/S00285-019-01332-9 |
0.644 |
|
| 2019 |
Hellmuth M. Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees Discrete Applied Mathematics. 267: 1-11. DOI: 10.1016/J.Dam.2019.06.015 |
0.481 |
|
| 2018 |
Geiß M, Anders J, Stadler PF, Wieseke N, Hellmuth M. Reconstructing gene trees from Fitch's xenology relation. Journal of Mathematical Biology. PMID 29951855 DOI: 10.1007/S00285-018-1260-8 |
0.611 |
|
| 2018 |
Nøjgaard N, Geiß M, Merkle D, Stadler PF, Wieseke N, Hellmuth M. Time-consistent reconciliation maps and forbidden time travel. Algorithms For Molecular Biology : Amb. 13: 2. PMID 29441122 DOI: 10.1186/S13015-018-0121-8 |
0.541 |
|
| 2018 |
Hellmuth M, Long Y, Geiß M, Stadler PF. A short note on undirected Fitch graphs The Art of Discrete and Applied Mathematics. 1: #1.08. DOI: 10.26493/2590-9770.1245.98C |
0.582 |
|
| 2018 |
Siems T, Hellmuth M, Liebscher V. Simultaneous Credible Regions for Multiple Changepoint Locations Journal of Computational and Graphical Statistics. 28: 290-298. DOI: 10.1080/10618600.2018.1513366 |
0.303 |
|
| 2017 |
Hellmuth M, Hernandez-Rosales M, Long Y, Stadler PF. Inferring phylogenetic trees from the knowledge of rare evolutionary events. Journal of Mathematical Biology. PMID 29218395 DOI: 10.1007/S00285-017-1194-6 |
0.566 |
|
| 2017 |
Hellmuth M. Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms For Molecular Biology : Amb. 12: 23. PMID 28861118 DOI: 10.1186/S13015-017-0114-Z |
0.451 |
|
| 2017 |
Hellmuth M, Wieseke N. On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions Journal of Combinatorial Optimization. 36: 591-616. DOI: 10.1007/S10878-017-0111-7 |
0.547 |
|
| 2016 |
Hellmuth M, Stadler PF, Wieseke N. The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations. Journal of Mathematical Biology. PMID 27904954 DOI: 10.1007/S00285-016-1084-3 |
0.569 |
|
| 2016 |
Hellmuth M, Lehner F. Fast factorization of Cartesian products of (directed) hypergraphs Theoretical Computer Science. 615: 1-11. DOI: 10.1016/J.Tcs.2015.11.038 |
0.382 |
|
| 2016 |
Hammack RH, Hellmuth M, Ostermeier L, Stadler PF. Associativity and Non-Associativity of Some Hypergraph Products Mathematics in Computer Science. 10: 403-408. DOI: 10.1007/S11786-016-0276-Y |
0.494 |
|
| 2015 |
Hellmuth M, Wieseke N, Lechner M, Lenhof HP, Middendorf M, Stadler PF. Phylogenomics with paralogs. Proceedings of the National Academy of Sciences of the United States of America. 112: 2058-63. PMID 25646426 DOI: 10.1073/Pnas.1412770112 |
0.557 |
|
| 2015 |
Hellmuth M, Imrich W, Kupka T. Fast recognition of partial star products and quasi cartesian products Ars Mathematica Contemporanea. 9: 233-252. DOI: 10.26493/1855-3974.520.933 |
0.534 |
|
| 2015 |
Hellmuth M, Marc T. On the Cartesian skeleton and the factorization of the strong product of digraphs Theoretical Computer Science. 565: 16-29. DOI: 10.1016/J.Tcs.2014.10.045 |
0.537 |
|
| 2015 |
Berkemer SJ, Chaves RRC, Fritz A, Hellmuth M, Hernandez-Rosales M, Stadler PF. Spiders can be Recognized by Counting Their Legs Mathematics in Computer Science. 9: 437-441. DOI: 10.1007/S11786-015-0233-1 |
0.611 |
|
| 2015 |
Hellmuth M, Wieseke N. On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9198: 609-623. DOI: 10.1007/978-3-319-21398-9_48 |
0.444 |
|
| 2015 |
Hellmuth M, Marc T, Ostermeier L, Stadler PF. The relaxed square property Australasian Journal of Combinatorics. 62: 240-270. |
0.494 |
|
| 2014 |
Hellmuth M, Leydold J, Stadler PF. Convex cycle bases Ars Mathematica Contemporanea. 7: 123-140. DOI: 10.26493/1855-3974.226.0A2 |
0.62 |
|
| 2014 |
Hernandez-Rosales M, Wieseke N, Hellmuth M, Stadler PF. Simulation of gene family histories Bmc Bioinformatics. 15. DOI: 10.1186/1471-2105-15-S3-A8 |
0.534 |
|
| 2014 |
Hellmuth M, Ostermeier L, Stadler PF. Unique square property, equitable partitions, and product-like graphs Discrete Mathematics. 320: 92-103. DOI: 10.1016/J.Disc.2013.12.012 |
0.649 |
|
| 2014 |
Hellmuth M, Noll M, Ostermeier L. Strong products of hypergraphs: Unique prime factorization theorems and algorithms Discrete Applied Mathematics. 171: 60-71. DOI: 10.1016/J.Dam.2014.02.017 |
0.544 |
|
| 2013 |
Hellmuth M, Hernandez-Rosales M, Huber KT, Moulton V, Stadler PF, Wieseke N. Orthology relations, symbolic ultrametrics, and cographs. Journal of Mathematical Biology. 66: 399-420. PMID 22456957 DOI: 10.1007/S00285-012-0525-X |
0.617 |
|
| 2013 |
Hellmuth M. On the complexity of recognizing S-composite and S-prime graphs Discrete Applied Mathematics. 161: 1006-1013. DOI: 10.1016/J.Dam.2012.11.003 |
0.545 |
|
| 2013 |
Hellmuth M, Imrich W, Kupka T. Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs Mathematics in Computer Science. 7: 255-273. DOI: 10.1007/S11786-013-0156-7 |
0.551 |
|
| 2012 |
Hellmuth M, Ostermeier PJ, Stadler PF. Minimum cycle bases of lexicographic products Ars Mathematica Contemporanea. 5: 223-234. DOI: 10.26493/1855-3974.172.8A7 |
0.542 |
|
| 2012 |
Hernandez-Rosales M, Hellmuth M, Wieseke N, Huber KT, Moulton V, Stadler PF. From event-labeled gene trees to species trees Bmc Bioinformatics. 13. DOI: 10.1186/1471-2105-13-S19-S6 |
0.554 |
|
| 2012 |
Hellmuth M, Ostermeier L, Stadler PF. Diagonalized Cartesian products of S-prime graphs are S-prime Discrete Mathematics. 312: 74-80. DOI: 10.1016/J.Disc.2011.03.033 |
0.628 |
|
| 2012 |
Hellmuth M, Ostermeier L, Stadler PF. A Survey on Hypergraph Products Mathematics in Computer Science. 6: 1-32. DOI: 10.1007/S11786-012-0109-6 |
0.569 |
|
| 2012 |
Ostermeier L, Hellmuth M, Stadler PF. The Cartesian product of hypergraphs Journal of Graph Theory. 70: 180-196. DOI: 10.1002/Jgt.20609 |
0.643 |
|
| 2011 |
Hellmuth M. A local prime factor decomposition algorithm Discrete Mathematics. 311: 944-965. DOI: 10.1016/J.Disc.2011.02.016 |
0.55 |
|
| 2010 |
Jänicke S, Heine C, Hellmuth M, Stadler PF, Scheuermann G. Visualization of graph products. Ieee Transactions On Visualization and Computer Graphics. 16: 1082-9. PMID 20975146 DOI: 10.1109/Tvcg.2010.217 |
0.651 |
|
| 2009 |
Hellmuth M, Merkle D, Middendorf M. Extended shapes for the combinatorial design of RNA sequences. International Journal of Computational Biology and Drug Design. 2: 371-84. PMID 20090177 DOI: 10.1504/Ijcbdd.2009.030767 |
0.375 |
|
| 2009 |
Ostermeier P, Hellmuth M, Klemm K, Leydold J, Stadler PF. A note on quasi-robust cycle bases Ars Mathematica Contemporanea. 2: 231-240. DOI: 10.26493/1855-3974.104.5B7 |
0.596 |
|
| 2009 |
Biyikoǧlu T, Hellmuth M, Leydold J. Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences Electronic Journal of Linear Algebra. 18: 202-210. DOI: 10.13001/1081-3810.1305 |
0.391 |
|
| 2009 |
Hellmuth M, Imrich W, Klöckl W, Stadler PF. Approximate graph products European Journal of Combinatorics. 30: 1119-1133. DOI: 10.1016/J.Ejc.2008.09.006 |
0.65 |
|
| 2009 |
Hellmuth M, Imrich W, Klöckl W, Stadler PF. Local algorithms for the prime factorization of strong product graphs Mathematics in Computer Science. 2: 653-682. DOI: 10.1007/S11786-009-0073-Y |
0.611 |
|
| Show low-probability matches. |