I have studied bioinformatics at Eberhard-Karls-Universität Tübingen, then spent a year at Technische Universität München (chair of Prof. Dr. Ernst W. Mayr), and finally made my doctoral degree at Friedrich-Schiller-Universität Jena (chair of Prof. Dr. Rolf Niedermeier).

My research was supported by a generous scholarship from the Deutsche Telekom Stiftung. Additional (ideal) support came from the National German Academic Foundation.

            

S. Wernicke.
Combinatorial algorithms to cope with the complexity of biological networks.    
Ph.D. Thesis, Universität Jena, 2006.

S. Wernicke.
On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems.    
Diploma Thesis, Universität Tübingen, 2003.

F. Hüffner, R. Niedermeier, and S. Wernicke.
Fixed–parameter algorithms for graph–modeled data clustering.    
In: Clustering Challenges in Biological Networks, to appear 2008.

F. Hüffner, R. Niedermeier, and S. Wernicke.
Developing fixed–parameter algorithms to solve combinatorially explosive biological problems.    
In: Bioinformatics, Volume II: Structure, Function and Applications, 395–422, Humana Press, 2008.

S. Eckhardt, S. Kosub, M. G. Maaß, H. Täubig, and S. Wernicke.
Combinatorial Network Abstraction by Trees and Distances.    
Theoretical Computer Science, accepted for publication.

F. Hüffner, S. Wernicke, and T. Zichner.
Algorithm engineering for color-coding with applications to signaling pathway detection.          
Algorithmica, accepted for publication.

M. Dom, J. Guo, R. Niedermeier, and S. Wernicke.
Red–blue covering problems and the consecutive ones property.       
Journal of Discrete Algorithms, 6(3):393–407, 2008.

F. Hüffner, R. Niedermeier, and S. Wernicke.
Techniques for practical fixed–parameter algorithms.       
The Computer Journal, 51(1):7–25, 2008.

J. Guo, R. Niedermeier, and S. Wernicke.
Parameterized complexity of Vertex Cover variants.      
Theory of Computing Systems, 41(3):501–520, 2007.

S. Wernicke and F. Rasche.
Simple and fast alignment of metabolic pathways by exploiting local diversity.           
Bioinformatics, 23(15):1978–1985, 2007.

F. Hüffner, S. Wernicke, and T. Zichner.
FASPAD: Fast signaling pathway detection.           
Bioinformatics, 23(13):1708–1709, 2007.

S. Wernicke, J. Alber, J. Gramm, J. Guo, and R. Niedermeier.
The computational complexity of avoiding forbidden submatrices by row deletions.      
International Journal of Foundations of Computer Science, 17(6): 1467–1484, 2006.

J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke.
Compression–based fixed–parameter algorithms for Feedback Vertex Set and Edge Bipartization.       
Journal of Computer and System Sciences, 72(8):1386–1396, 2006.

S. Wernicke.
Efficient detection of network motifs.          
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):347–359, 2006.

S. Wernicke and F. Rasche.
FANMOD: a tool for fast network motif detection.           
Bioinformatics, 22(9):1152–1153, 2006.

S. Wernicke and F. Rasche.
Simple and fast alignment of metabolic pathways by exploiting local diversity.         
Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC 2007). Advances in Bioinformatics and Computational Biology 5, 353–362, Imperial College Press, January 2007.

F. Hüffner, S. Wernicke, and T. Zichner.
Algorithm engineering for color–coding to facilitate signaling pathway detection.         
Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC 2007). Advances in Bioinformatics and Computational Biology 5, 277–286, Imperial College Press, January 2007.

J. Guo, R. Niedermeier, and S. Wernicke.
Fixed–parameter tractability results for Full–Degree Spanning Tree and its dual.       
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC '06). Lecture Notes in Computer Science 4169, 203–214, Springer-Verlag, September 2006.

M. Dom, J. Guo, R. Niedermeier, and S. Wernicke.
Minimum membership set covering and the consecutive ones property.       
Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT '06). Lecture Notes in Computer Science 4059, 339–350, Springer-Verlag, July 2006.

S. Eckhardt, S. Kosub, M. G. Maaß, H. Täubig, and S. Wernicke.
Combinatorial network abstraction by trees and distances.       
Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC '05). Lecture Notes in Computer Science 3827, 1100–1109, Springer-Verlag, December 2005.

S. Wernicke.
A faster algorithm for detecting network motifs.             
Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI '05). Lecture Notes in Bioinformatics 3692, 165–177, Springer-Verlag, October 2005.

J. Guo, R. Niedermeier, and S. Wernicke.
Parameterized complexity of generalized Vertex Cover problems.         
Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS '05). Lecture Notes in Computer Science 3608, 36–48, Springer-Verlag, August 2005.

J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke.
Improved fixed–parameter algorithms for two feedback set problems.       
Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS '05). Lecture Notes in Computer Science 3608, 158–168, Springer-Verlag, August 2005.

S. Wernicke, J. Alber, J. Gramm, J. Guo, and R. Niedermeier.
Avoiding forbidden submatrices by row deletions.       
Proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '04). Lecture Notes in Computer Science 2932, 349–361, Springer-Verlag, January 2004.

S. Wernicke.
Practical fixed–parameter algorithms for graph–modeled data clustering.    
Talk held at the DIMACS Workshop on Clustering Problems in Biological Networks. Rutgers University, USA, May 9–11, 2006.

S. Wernicke.
Fast detection of network motifs.    
Presented at the DIMACS Workshop on Biomolecular Networks: Topological Properties and Evolution. Rutgers University, USA, May 11–13, 2005.