| Publication | Date of Publication | Type |
|---|
On the compressive power of autoencoders with linear and ReLU activation functions
Neural Computation | 2025-05-21 | Paper |
Finding and analyzing the minimum set of driver nodes in control of Boolean networks
Advances in Complex Systems | 2024-10-30 | Paper |
| On the complexity of tree edit distance with variables | 2024-09-11 | Paper |
Accurate multi-view clustering to seek the cross-viewed yet uniform sample assignment via tensor feature matching
Information Sciences | 2024-05-06 | Paper |
Approximating minimum keys and optimal substructure screens
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| scientific article; zbMATH DE number 7561381 (Why is no real title available?) | 2022-07-21 | Paper |
Comparison of the representational power of random forests, binary decision diagrams, and neural networks
Neural Computation | 2022-06-13 | Paper |
Discrimination of attractors with noisy nodes in Boolean networks
Automatica | 2021-11-19 | Paper |
Stability and restoration phenomena in competitive systems
PTEP. Progress of Theoretical and Experimental Physics | 2021-10-05 | Paper |
New and improved algorithms for unordered tree inclusion
Theoretical Computer Science | 2021-08-27 | Paper |
New and improved algorithms for unordered tree inclusion
Theoretical Computer Science | 2021-08-27 | Paper |
Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree
International Journal of Foundations of Computer Science | 2021-04-20 | Paper |
| A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications | 2020-12-16 | Paper |
Control of Boolean networks: hardness results and algorithms for tree structured networks
Journal of Theoretical Biology | 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
Journal of Computer and System Sciences | 2019-08-30 | Paper |
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
Algorithms | 2019-03-26 | Paper |
On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors
Journal of Theoretical Biology | 2019-02-06 | Paper |
Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets
Journal of Complex Networks | 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
Computational Statistics and Data Analysis | 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
Automatica | 2017-11-17 | Paper |
Maximum margin classifier working in a set of strings
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
On the parameterized complexity of associative and commutative unification
Theoretical Computer Science | 2016-12-22 | Paper |
On the parameterized complexity of associative and commutative unification
Parameterized and Exact Computation | 2015-09-15 | Paper |
On the parameterized complexity of associative and commutative unification
Parameterized and Exact Computation | 2015-09-15 | Paper |
On the complexity of finding a largest common subtree of bounded degree
Theoretical Computer Science | 2015-06-10 | Paper |
Efficient exponential-time algorithms for edit distance between unordered trees
Journal of Discrete Algorithms | 2014-04-01 | Paper |
On the complexity of finding a largest common subtree of bounded degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree
Algorithms and Computation | 2013-03-21 | Paper |
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Theoretical Computer Science | 2013-02-19 | Paper |
A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Efficient exponential time algorithms for edit distance between unordered trees
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Inferring a graph from path frequency
Discrete Applied Mathematics | 2012-06-18 | Paper |
A bisection algorithm for grammar-based compression of ordered trees
Information Processing Letters | 2012-03-27 | Paper |
Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
Information Processing Letters | 2012-03-19 | Paper |
Singleton and 2-periodic attractors of sign-definite Boolean networks
Information Processing Letters | 2012-03-09 | Paper |
Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
Journal of Mathematical Chemistry | 2011-05-11 | Paper |
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
Mathematics in Computer Science | 2011-02-19 | Paper |
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science | 2011-02-02 | Paper |
Improved approximation of the largest common subtree of two unordered trees of bounded height
Information Processing Letters | 2010-06-09 | Paper |
Approximating tree edit distance through string edit distance
Algorithmica | 2010-03-23 | Paper |
A relation between edit distance for ordered trees and edit distance for Euler strings
Information Processing Letters | 2010-01-29 | Paper |
A mathematical model for generating bipartite graphs and its application to protein networks
Journal of Physics A: Mathematical and Theoretical | 2010-01-05 | Paper |
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
Algorithms and Computation | 2009-12-17 | Paper |
Completing networks using observed data
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Performance analysis of a greedy algorithm for inferring Boolean functions
Information Processing Letters | 2009-08-27 | Paper |
A grammatical approach to RNA-RNA interaction prediction
Pattern Recognition | 2009-04-17 | Paper |
Algorithms for Inference, Analysis and Control of Boolean Networks
Algebraic Biology | 2009-02-03 | Paper |
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
Algebraic Biology | 2009-02-03 | Paper |
A constructive approach to gene expression dynamics
Physics Letters. A | 2008-05-07 | Paper |
Approximating Tree Edit Distance Through String Edit Distance
Algorithms and Computation | 2008-04-24 | Paper |
A stochastic approach to multi-gene expression dynamics
Physics Letters. A | 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
Fundamentals of Computation Theory | 2008-02-26 | Paper |
An Efficient Algorithm for Generating Colored Outerplanar Graphs
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Control Model for Markovian Genetic Regulatory Networks
Transactions on Computational Systems Biology V | 2007-09-10 | Paper |
On the complexity of deriving position specific score matrices from positive and negative sequences
Discrete Applied Mathematics | 2007-04-18 | Paper |
ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
International Journal of Foundations of Computer Science | 2006-08-14 | Paper |
ON THE RELATION BETWEEN FLUCTUATION AND SCALING-LAW IN GENE EXPRESSION TIME SERIES FROM YEAST TO HUMAN
Modern Physics Letters B | 2006-03-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2185643 (Why is no real title available?) | 2005-07-04 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2089966 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087052 (Why is no real title available?) | 2004-08-11 | Paper |
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
Theoretical Computer Science | 2003-05-22 | Paper |
A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
Theoretical Computer Science | 2003-05-14 | Paper |
Point matching under non-uniform distortions.
Discrete Applied Mathematics | 2003-04-28 | Paper |
Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
Journal of Combinatorial Optimization | 2001-11-20 | Paper |
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
Discrete Applied Mathematics | 2001-03-17 | Paper |
| scientific article; zbMATH DE number 1555958 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555919 (Why is no real title available?) | 2001-01-24 | Paper |
On the approximation of largest common subtrees and largest common point sets
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1351085 (Why is no real title available?) | 1999-10-24 | Paper |
| scientific article; zbMATH DE number 1303613 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303033 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1301094 (Why is no real title available?) | 1999-06-15 | Paper |
On the approximation of protein threading
Theoretical Computer Science | 1999-01-12 | Paper |
On determining the congruence of point sets in \(d\) dimensions
Computational Geometry | 1998-04-13 | Paper |
