Noisy: Identification of problematic columns in multiple sequence alignments (2008)
Dress, Andreas WM, Flamm, Christoph, Fritzsch, Guido, Grünewald, Stefan, Kruspe, Matthias, Prohaska, Sonja J, ...
Abstract Motivation Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Large...
Alex Grossmann, Stefan Grünewald
d corresponding author The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 � � n 4 binary trees with exactly four...
Grünewald, Stefan, Forslund, Kristoffer, Dress, Andreas, Moulton, Vincent
We present QNet, a method for constructing split networks from weighted quartet trees. QNet can be viewed as a quartet analogue of the distance-based Neighbor-Net (NNet) method for network...
Abstract Closure operations in phylogenetics (2006)
Stefan Grünewald, Mike Steel, M. Shel Swenson
Closure operations are a useful device in both the theory and practice of tree reconstruction in biology and other areas of classification. These operations take a collection of trees (rooted or...
Stefan Grünewald, Kristoffer Forslund, Andreas Dress, Vincent Moulton, Splitstree Quartet, Stefan Grünewald
QNet: An agglomerative method for the construction of phylogenetic networks from weighted quartets
Chromatic index critical graphs and multigraphs (2000)
We consider graphs and multigraphs which are critical with respect to the chromatic index. In chapter 3, we give a construction of critical multigraphs with exactly 20 vertices and maximum degree k...
Chromatic-Index Critical Multigraphs of Order 20 (2000)
A multigraph M with maximum degree \Delta(M ) is called critical, if the chromatic index Ø 0 (M) ? \Delta(M ) and Ø 0 (M \Gamma e) = Ø 0 (M) \Gamma 1 for each edge e of M . The weak critical graph...
Cyclically 5-Edge Connected Non-Bicritical Critical Snarks (1997)
Stefan Grünewald, Eckhard Steffen
Snarks are bridgeless cubic graphs with chromatic index Ø 0 = 4. A snark G is called critical if Ø 0 (G \Gamma fv; wg) = 3, for any two adjacent vertices v and w. For any k 2 we construct...
Chromatic-Index Critical Graphs of Even Order (1997)
Stefan Grünewald, Eckhard Steffen
A k-critrical graph G has maximum degree k 0, chromatic index Ø 0 (G) = k + 1 and Ø 0 (G \Gamma e) ! k + 1 for each edge e of G. The Critical Graph Conjecture, Jakobsen [8] and Beineke, Wilson [1],...