Zobrazeno 1 - 10
of 3 515
pro vyhledávání: '"A Frohn"'
We propose the first branch-&-price algorithm for the maximum agreement forest problem on unrooted binary trees: given two unrooted X-labelled binary trees we seek to partition X into a minimum number of blocks such that the induced subtrees are disj
Externí odkaz:
http://arxiv.org/abs/2410.04122
Autor:
Frohn, Martin, Kelk, Steven
Finding the most parsimonious tree inside a phylogenetic network with respect to a given character is an NP-hard combinatorial optimization problem that for many network topologies is essentially inapproximable. In contrast, if the network is a roote
Externí odkaz:
http://arxiv.org/abs/2409.18077
Autor:
Frohn, Martin, Manson, Kerry
A phylogenetic tree is an edge-weighted binary tree, with leaves labelled by a collection of species, that represents the evolutionary relationships between those species. For such a tree, a phylogenetic diversity index is a function that apportions
Externí odkaz:
http://arxiv.org/abs/2409.15641
Semi-directed networks are partially directed graphs that model evolution where the directed edges represent reticulate evolutionary events. We present an algorithm that reconstructs binary $n$-leaf semi-directed level-1 networks in $O( n^2)$ time fr
Externí odkaz:
http://arxiv.org/abs/2409.06034
Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees, such as hybridization, introgression, and lateral gene transfer. Studying phylogenetic networks under a statistical model of DNA sequence evolutio
Externí odkaz:
http://arxiv.org/abs/2407.11720
Autor:
Peter Martus, F Rapp, Hartmut Bertz, A Schmitt, M Hoffmann, B Stein, E Winkler, Stefanie Joos, Barbara Grün, M Wensing, M Reuter, K Muller, J Szecsenyi, A Kestler, Jan Valentini, Daniela Fröhlich, Regina Stolz, Cornelia Mahler, Nadja Klafke, Markus Horneber, Jona Frasch, Klaus Kramer, Katrin Tomaschko-Ubeländer, B Kröger, B Noack, B Wattenberg, E Kaschdailewitsch, H Mauch, K Gauß, K Harder, L Lohmüller, A Seckinger, D Zips, M Busacker-Scharpff, M Krug, S Eismann, B Leicht, C Nagat, C Raff, K Kraus, W Kmietschak, A Battran, A Frohn, B Held, C Perinchery, C Pfister-Jimenéz, H Dürsch, J Bossert, A Kaltenbach, U Boltenhagen, A Behzad, A Leppert, B Broge, C Witte, S Treffert, AOK Baden-Württemberg
Publikováno v:
BMJ Open, Vol 12, Iss 2 (2022)
Externí odkaz:
https://doaj.org/article/7b2da101d165413caf0f72a5983ca360
Autor:
Zimmermann, Erik, Jalil, Abdur Rehman, Schleenvoigt, Michael, Karthein, Jan, Frohn, Benedikt, Behner, Gerrit, Lentz, Florian, Trellenkamp, Stefan, Neumann, Elmar, Schüffelgen, Peter, Lüth, Hans, Grützmacher, Detlev, Schäpers, Thomas
Nanoscale superconducting quantum interference devices (SQUIDs) are fabricated in-situ from a single Bi$_{0.26}$Sb$_{1.74}$Te$_{3}$ nanoribbon that is defined using selective-area growth and contacted with superconducting Nb electrodes via a shadow m
Externí odkaz:
http://arxiv.org/abs/2403.13689
In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a $(2/3)$-approximation for the Maximum Independent Set problem on interval graphs. We show that this is tight, even on unit interval graphs of maxim
Externí odkaz:
http://arxiv.org/abs/2403.10868
Autor:
Frohn, Florian, Giesl, Jürgen
SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far. However, in the context of program verification, polynomials are often
Externí odkaz:
http://arxiv.org/abs/2402.01501
Autor:
Frohn, Florian, Giesl, Jürgen
Bounded Model Checking (BMC) is a powerful technique for proving unsafety. However, finding deep counterexamples that require a large bound is challenging for BMC. On the other hand, acceleration techniques compute "shortcuts" that "compress" many ex
Externí odkaz:
http://arxiv.org/abs/2401.09973