Sebastian Wernicke

ORCID: 0000-0003-0799-2412
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Metal Forming Simulation Techniques
  • Metallurgy and Material Forming
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Bioinformatics and Genomic Networks
  • Gene Regulatory Network Analysis
  • Advanced Surface Polishing Techniques
  • Algorithms and Data Compression
  • Metal and Thin Film Mechanics
  • Laser and Thermal Forming Techniques
  • Manufacturing Process and Optimization
  • Complex Network Analysis Techniques
  • Digital Innovation in Industries
  • semigroups and automata theory
  • Graph Theory and Algorithms
  • graph theory and CDMA systems
  • Interconnection Networks and Systems
  • Optimization and Search Problems
  • Microbial Natural Products and Biosynthesis
  • Microstructure and mechanical properties
  • Microbial Metabolic Engineering and Bioproduction
  • Computational Geometry and Mesh Generation
  • DNA and Biological Computing
  • Genomics and Chromatin Dynamics
  • Vehicle Routing Optimization Methods

TU Dortmund University
2016-2022

Seven Bridges Genomics (United States)
2016

Friedrich Schiller University Jena
2005-2010

University of Tübingen
2004

Abstract Summary: Motifs are small connected subnetworks that a network displays in significantly higher frequencies than would be expected for random network. They have recently gathered much attention as concept to uncover structural design principles of complex biological networks. FANMOD is tool fast motif detection; it relies on developed algorithms improve the efficiency detection by some orders magnitude over existing tools. This facilitates larger motifs bigger networks previously...

10.1093/bioinformatics/btl038 article EN Bioinformatics 2006-02-02

Motifs in a given network are small connected subnetworks that occur significantly higher frequencies than would be expected random networks. They have recently gathered much attention as concept to uncover structural design principles of complex Kashtan et al. [Bioinformatics, 2004] proposed sampling algorithm for performing the computationally challenging task detecting motifs. However, among other drawbacks, this suffers from bias and scales poorly with increasing subgraph size. Based on...

10.1109/tcbb.2006.51 article EN IEEE/ACM Transactions on Computational Biology and Bioinformatics 2006-10-01

The fixed-parameter approach is an algorithm design technique for solving combinatorially hard (mostly NP-hard) problems. For some of these problems, it can lead to algorithms that are both efficient and yet at the same time guaranteed find optimal solutions. Focusing on their application NP-hard problems in practice, we survey three main techniques develop algorithms, namely: kernelization (data reduction with provable performance guarantee), depth-bounded search trees a new called...

10.1093/comjnl/bxm040 article EN The Computer Journal 2007-03-06

Abstract Motivation: An important tool for analyzing biological networks is the ability to perform homology searches, i.e. given a pattern network one would like be able search occurrences of similar (sub)networks within set host networks. In context metabolic pathways, Pinter et al. [Bioinformatics, 2005] proposed solve this computationally hard problem by restricting it case where both and are trees. This restriction, however, severely limits applicability their algorithm. Results: We...

10.1093/bioinformatics/btm279 article EN Bioinformatics 2007-05-31

Abstract Summary: Faspad is a user-friendly tool that detects candidates for linear signaling pathways in protein interaction networks based on an approach by Scott et al. (Journal of Computational Biology, 2006). Using recent algorithmic insights, it can solve the underlying NP-hard problem quite fast: typical size (several thousand nodes), pathway length up to 13 proteins be found within seconds and with 99.9% probability optimality. graphically displays all are found; evaluation...

10.1093/bioinformatics/btm160 article EN Bioinformatics 2007-04-26

Abstract Incremental sheet-bulk metal forming (iSBMF) enables the manufacture of functional lightweight components featuring a load-adapted shape with high material efficiency. The flexibility incremental process allows for modification strain path through adjustment tool motion while maintaining final product geometry. These modifications generate both different hardening and damage evolution. In this paper, numerical experimental investigation paths is carried out to identify their impact...

10.1007/s12289-020-01537-0 article EN cc-by International Journal of Material Forming 2020-01-17

The aim and objectives of this article are to provide an analytical model for the incremental forming gears along direction perpendicular sheet thickness. allows determining influence major process parameters in indentation force material volume undergoing plastic deformation during by means double-wedge gear tooth punches. Special emphasis is placed on superimposing tension stresses in-plane direction. built upon slip-line theory under plane strain conditions, results compared against those...

10.1177/0954405416654190 article EN Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture 2016-07-07

This article investigates the possibility of failure by crack-opening mode III (out-of-plane shearing) in sheet–bulk metal forming processes. The investigation makes use experimentally and theoretically determined fracture-forming limits aluminium AA1050-H111 sheets with 1 mm thickness, experimental tests incremental ploughing a roll-tipped tool numerical simulation using commercial finite element programme. Results show that thin under large indentation depths gives rise to transverse...

10.1177/0309324716639773 article EN The Journal of Strain Analysis for Engineering Design 2016-03-22

10.1016/j.jda.2007.11.002 article EN publisher-specific-oa Journal of Discrete Algorithms 2008-01-07
Coming Soon ...