| Complete characterization of incorrect orthology assignments in best match graphs D Schaller, M Geiß, PF Stadler, M Hellmuth Journal of Mathematical Biology 82 (3), 1-64, 2021 | 21 | 2021 |
| From pairs of most similar sequences to phylogenetic best matches PF Stadler, M Geiß, D Schaller, A López Sánchez, M González Laffitte, ... Algorithms for Molecular Biology 15, 1-20, 2020 | 18 | 2020 |
| Indirect identification of horizontal gene transfer D Schaller, M Lafond, PF Stadler, N Wieseke, M Hellmuth Journal of Mathematical Biology 83 (1), 1-73, 2021 | 16 | 2021 |
| Corrigendum to “Best match graphs” D Schaller, M Geiß, E Chávez, M González Laffitte, A López Sánchez, ... Journal of Mathematical Biology 82, 1-9, 2021 | 14 | 2021 |
| Complexity of modification problems for best match graphs D Schaller, PF Stadler, M Hellmuth Theoretical Computer Science, 2021 | 13 | 2021 |
| Clustering systems of phylogenetic networks M Hellmuth, D Schaller, PF Stadler Theory in Biosciences 142 (4), 301-358, 2023 | 11 | 2023 |
| Best match graphs with binary trees D Schaller, M Geiß, M Hellmuth, PF Stadler International Conference on Algorithms for Computational Biology, 82-93, 2021 | 10 | 2021 |
| AsymmeTree: A Flexible Python Package for the Simulation of Complex Gene Family Histories D Schaller, M Hellmuth, PF Stadler Software 1 (3), 276-298, 2022 | 7 | 2022 |
| Compatibility of partitions with trees, hierarchies, and split systems M Hellmuth, D Schaller, PF Stadler Discrete Applied Mathematics 314, 265-283, 2022 | 7 | 2022 |
| Heuristic algorithms for best match graph editing D Schaller, M Geiß, M Hellmuth, PF Stadler Algorithms for Molecular Biology 16, 1-32, 2021 | 7 | 2021 |
| Best match graphs with binary trees D Schaller, M Geiß, M Hellmuth, PF Stadler IEEE/ACM Transactions on Computational Biology and Bioinformatics 20 (3 …, 2022 | 5 | 2022 |
| Combining orthology and xenology data in a common phylogenetic tree M Hellmuth, M Michel, NN Nøjgaard, D Schaller, PF Stadler Brazilian Symposium on Bioinformatics, 53-64, 2021 | 5 | 2021 |
| A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set D Schaller, M Hellmuth, PF Stadler Algorithms for Molecular Biology 16, 1-11, 2021 | 4 | 2021 |
| Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs D Schaller, M Geiß, M Hellmuth, PF Stadler Algorithms 14 (4), 110, 2021 | 4 | 2021 |
| Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees D Schaller, M Hellmuth, PF Stadler SIAM Journal on Discrete Mathematics 37 (3), 2172-2207, 2023 | 3 | 2023 |
| From best hits to best matches PF Stadler, M Geiß, D Schaller, AL Sánchez, ME González, DI Valdivia, ... arXiv preprint arXiv:2001.00958, 2020 | 3 | 2020 |
| Relative timing information and orthology in evolutionary scenarios D Schaller, T Hartmann, M Lafond, PF Stadler, N Wieseke, M Hellmuth Algorithms for Molecular Biology 18 (1), 16, 2023 | 1 | 2023 |
| Quasi-best match graphs A Korchmaros, D Schaller, M Hellmuth, PF Stadler Discrete Applied Mathematics 331, 104-125, 2023 | 1 | 2023 |
| Gene family histories: theory and algorithms D Schaller Max Planck Institute for Mathematics in the Sciences, Max Planck Society, 2021 | 1 | 2021 |
| A linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set D Schaller, M Hellmuth, PF Stadler CoRR, 2021 | 1 | 2021 |
Peter F StadlerProfessor of Bioinformatics, Univ. Leipzig在 bioinf.uni-leipzig.de 的电子邮件经过验证
