Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Eickmeyer Kord"'
Publikováno v:
Algorithms for Molecular Biology, Vol 3, Iss 1, p 5 (2008)
Abstract The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is "optimal" when the algorithm outp
Externí odkaz:
https://doaj.org/article/499a2494a67c44e08a5ea9ae75c3bda8
Autor:
Eickmeyer, Kord, Heuvel, Jan van den, Kawarabayashi, Ken-ichi, Kreutzer, Stephan, de Mendez, Patrice Ossona, Pilipczuk, Michał, Quiroz, Daniel A., Rabinovich, Roman, Siebertz, Sebastian
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but it does b
Externí odkaz:
http://arxiv.org/abs/1812.08003
Autor:
Bae, Sang Won, Baffier, Jean-Francois, Chun, Jinhee, Eades, Peter, Eickmeyer, Kord, Grilli, Luca, Hong, Seok-Hee, Korman, Matias, Montecchiani, Fabrizio, Rutter, Ignaz, Tóth, Csaba D.
Publikováno v:
Theoretical Computer Science 745 (2018), 36-52
We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated
Externí odkaz:
http://arxiv.org/abs/1708.07653
Autor:
Eickmeyer, Kord, Giannopoulou, Archontia C., Kreutzer, Stephan, Kwon, O-joung, Pilipczuk, Michał, Rabinovich, Roman, Siebertz, Sebastian
We prove that whenever $G$ is a graph from a nowhere dense graph class $\mathcal{C}$, and $A$ is a subset of vertices of $G$, then the number of subsets of $A$ that are realized as intersections of $A$ with $r$-neighborhoods of vertices of $G$ is at
Externí odkaz:
http://arxiv.org/abs/1612.08197
We show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topologi
Externí odkaz:
http://arxiv.org/abs/1605.01198
We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for logics wi
Externí odkaz:
http://arxiv.org/abs/1603.09055
Autor:
Eickmeyer, Kord, Grohe, Martin
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 3 (September 21, 2011) lmcs:714
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BP
Externí odkaz:
http://arxiv.org/abs/1107.3430
Autor:
Eickmeyer, Kord, Yoshida, Ruriko
Publikováno v:
It is published in the proceedings of Algebraic Biology, Springer LNC Series (2008), p82-96
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstruction are each determined by a polyhedral subdivision of the space of
Externí odkaz:
http://arxiv.org/abs/0908.0098
The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is ``optimal'' when the algorithm outputs the
Externí odkaz:
http://arxiv.org/abs/0710.5142
Autor:
Eickmeyer, Kord, Yoshida, Ruriko
In this paper, we will analyze the behavior of the Neighbor Joining algorithm on five taxa and we will show that the partition of the sample (data) space for estimation of a tree topology with five taxa into subspaces, within each of which the Neighb
Externí odkaz:
http://arxiv.org/abs/math/0703081