| Publication | Date of Publication | Type |
|---|
| Approximating minimum keys and optimal substructure screens | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091018 | 2022-07-21 | Paper |
| Comparison of the Representational Power of Random Forests, Binary Decision Diagrams, and Neural Networks | 2022-06-13 | Paper |
| Discrimination of attractors with noisy nodes in Boolean networks | 2021-11-19 | Paper |
| Stability and restoration phenomena in competitive systems | 2021-10-05 | Paper |
| New and improved algorithms for unordered tree inclusion | 2021-08-27 | Paper |
| Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree | 2021-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140773 | 2020-12-16 | Paper |
| Control of Boolean networks: hardness results and algorithms for tree structured networks | 2020-10-28 | Paper |
| A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming | 2020-09-28 | Paper |
| Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings | 2019-08-30 | Paper |
| A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree | 2019-03-26 | Paper |
| On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors | 2019-02-06 | Paper |
| Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets | 2018-10-16 | Paper |
| Algorithms for analysis and control of Boolean networks | 2018-08-15 | Paper |
| A likelihood-free filtering method via approximate Bayesian computation in evaluating biological simulation models | 2018-08-15 | Paper |
| Algorithms for Analysis, Inference, and Control of Boolean Networks | 2018-02-22 | Paper |
| Discrimination of singleton and periodic attractors in Boolean networks | 2017-11-17 | Paper |
| Maximum margin classifier working in a set of strings | 2017-09-29 | Paper |
| On the parameterized complexity of associative and commutative unification | 2016-12-22 | Paper |
| On the Parameterized Complexity of Associative and Commutative Unification | 2015-09-15 | Paper |
| On the complexity of finding a largest common subtree of bounded degree | 2015-06-10 | Paper |
| Efficient exponential-time algorithms for edit distance between unordered trees | 2014-04-01 | Paper |
| On the Complexity of Finding a Largest Common Subtree of Bounded Degree | 2013-08-16 | Paper |
| On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree | 2013-03-21 | Paper |
| Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees | 2013-02-19 | Paper |
| A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree | 2012-09-25 | Paper |
| Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees | 2012-08-14 | Paper |
| Inferring a graph from path frequency | 2012-06-18 | Paper |
| A bisection algorithm for grammar-based compression of ordered trees | 2012-03-27 | Paper |
| Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time | 2012-03-19 | Paper |
| Singleton and 2-periodic attractors of sign-definite Boolean networks | 2012-03-09 | Paper |
| Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming | 2011-05-11 | Paper |
| Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks | 2011-02-19 | Paper |
| Exact algorithms for computing the tree edit distance between unordered trees | 2011-02-02 | Paper |
| Improved approximation of the largest common subtree of two unordered trees of bounded height | 2010-06-09 | Paper |
| Approximating tree edit distance through string edit distance | 2010-03-23 | Paper |
| A relation between edit distance for ordered trees and edit distance for Euler strings | 2010-01-29 | Paper |
| A mathematical model for generating bipartite graphs and its application to protein networks | 2010-01-05 | Paper |
| Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming | 2009-12-17 | Paper |
| Completing Networks Using Observed Data | 2009-12-01 | Paper |
| Performance analysis of a greedy algorithm for inferring Boolean functions | 2009-08-27 | Paper |
| A grammatical approach to RNA-RNA interaction prediction | 2009-04-17 | Paper |
| Algorithms for Inference, Analysis and Control of Boolean Networks | 2009-02-03 | Paper |
| An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes | 2009-02-03 | Paper |
| A constructive approach to gene expression dynamics | 2008-05-07 | Paper |
| Approximating Tree Edit Distance Through String Edit Distance | 2008-04-24 | Paper |
| A stochastic approach to multi-gene expression dynamics | 2008-03-25 | Paper |
| An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes | 2008-02-26 | Paper |
| An Efficient Algorithm for Generating Colored Outerplanar Graphs | 2007-11-13 | Paper |
| A Control Model for Markovian Genetic Regulatory Networks | 2007-09-10 | Paper |
| On the complexity of deriving position specific score matrices from positive and negative sequences | 2007-04-18 | Paper |
| ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES | 2006-08-21 | Paper |
| FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES | 2006-08-14 | Paper |
| ON THE RELATION BETWEEN FLUCTUATION AND SCALING-LAW IN GENE EXPRESSION TIME SERIES FROM YEAST TO HUMAN | 2006-03-13 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024811 | 2005-07-04 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808629 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737698 | 2004-08-11 | Paper |
| Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model. | 2003-05-22 | Paper |
| A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis | 2003-05-14 | Paper |
| Point matching under non-uniform distortions. | 2003-04-28 | Paper |
| Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages | 2001-11-20 | Paper |
| Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots | 2001-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525682 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525728 | 2001-01-24 | Paper |
| On the approximation of largest common subtrees and largest common point sets | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267805 | 1999-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249533 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250239 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246740 | 1999-06-15 | Paper |
| On the approximation of protein threading | 1999-01-12 | Paper |
| On determining the congruence of point sets in \(d\) dimensions | 1998-04-13 | Paper |
