Cophylogenetic reconciliation with ILP N Wieseke, T Hartmann, M Bernt, M Middendorf IEEE/ACM Transactions on Computational Biology and Bioinformatics 12 (6 …, 2015 | 20 | 2015 |
Combinatorics of tandem duplication random loss mutations on circular genomes T Hartmann, AC Chu, M Middendorf, M Bernt IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 15 …, 2018 | 16 | 2018 |
Genome rearrangement with ILP T Hartmann, N Wieseke, R Sharan, M Middendorf, M Bernt IEEE/ACM transactions on computational biology and bioinformatics 15 (5 …, 2017 | 16 | 2017 |
Genome rearrangement analysis: cut and join genome rearrangements and gene cluster preserving approaches T Hartmann, M Middendorf, M Bernt Comparative Genomics: Methods and Protocols, 261-289, 2018 | 13 | 2018 |
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements T Hartmann, M Bernt, M Middendorf IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2018 | 11 | 2018 |
EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements T Hartmann, M Bernt, M Middendorf BMC Bioinformatics 19 (192), 2018 | 8 | 2018 |
Population based ant colony optimization for reconstructing ECG signals YC Cheng, T Hartmann, PY Tsai, M Middendorf Evolutionary Intelligence 9 (3), 55–66, 2016 | 7 | 2016 |
Population based ant colony optimization for reconstructing ECG signals YC Cheng, T Hartmann, PY Tsai, M Middendorf Applications of Evolutionary Computation 9597 (Lecture Notes in Computer …, 2016 | 7 | 2016 |
Complete edge-colored permutation graphs T Hartmann, M Bannach, M Middendorf, PF Stadler, N Wieseke, ... Advances in Applied Mathematics 139, 102377, 2022 | 3 | 2022 |
LazyB: fast and cheap genome assembly T Gatter, S von Löhneysen, J Fallmann, P Drozdova, T Hartmann, ... Algorithms for Molecular Biology 16 (1), 8, 2021 | 3 | 2021 |
A weighted population update rule for PACO applied to the single machine total weighted tardiness problem D Abitz, T Hartmann, M Middendorf Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 4-12, 2020 | 3 | 2020 |
Economic genome assembly from low coverage Illumina and Nanopore data T Gatter, S von Löhneysen, P Drozdova, T Hartmann, PF Stadler bioRxiv, 2020.02. 07.939454, 2020 | 3 | 2020 |
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses T Hartmann, M Bannach, M Middendorf IEEE/ACM Transactions on Computational Biology and Bioinformatics 18 (6 …, 2019 | 2 | 2019 |
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 |
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine P Geser, HT Le, T Hartmann, M Middendorf European Journal of Operational Research 303 (2), 593-601, 2022 | | 2022 |
Models and Algorithms for Sorting Permutations with Tandem Duplication and Random Loss T Hartmann http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa2-338224, 2019 | | 2019 |
Cophylogenetic Reconciliation with ILP: Supplemental Material N Wieseke, T Hartmann, M Bernt, M Middendorf | | |