| Publication | Date of Publication | Type |
|---|
| Inferring a tree from walks | 2022-08-18 | Paper |
| Automatic sparse principal component analysis | 2022-08-02 | Paper |
| Ensemble smoothers for inference of hidden states and parameters in combinatorial regulatory model | 2020-04-21 | Paper |
| A likelihood-free filtering method via approximate Bayesian computation in evaluating biological simulation models | 2018-08-15 | Paper |
| Extracting best consensus motifs from positive and negative examples | 2017-11-16 | Paper |
| Extension and verification of the SEIR model on the 2009 influenza A (H1N1) pandemic in Japan | 2014-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396686 | 2014-02-03 | Paper |
| Hybrid Petri net based modeling for biological pathway simulation | 2012-11-15 | Paper |
| Error tolerant model for incorporating biological knowledge with expression data in estimating gene networks | 2012-10-19 | Paper |
| Optimal search on clustered structural constraint for learning Bayesian network structure | 2012-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096193 | 2011-11-08 | Paper |
| Foundations of systems biology. Using cell illustrator and pathway databases. With CD-ROM. | 2010-12-02 | Paper |
| Graph inference from a walk for trees of bounded degree 3 is NP-complete | 2010-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456726 | 2008-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456781 | 2008-04-14 | Paper |
| Transactions on Computational Systems Biology IV | 2007-05-02 | Paper |
| On the complexity of deriving position specific score matrices from positive and negative sequences | 2007-04-18 | Paper |
| Computational Methods in Systems Biology | 2005-12-23 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044542 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737698 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736045 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736019 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420660 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420654 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413213 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413234 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413260 | 2003-07-17 | 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 |
| Fast algorithm for extracting multiple unordered short motifs using bit operations | 2003-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365945 | 2002-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937173 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935136 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703877 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250239 | 1999-06-17 | Paper |
| On the approximation of protein threading | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126936 | 1997-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126929 | 1997-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688904 | 1997-03-19 | Paper |
| Using maximal independent sets to solve problems in parallel | 1997-02-28 | Paper |
| Inferring a tree from walks | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888093 | 1996-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4290645 | 1995-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306227 | 1994-09-19 | Paper |
| A machine discovery from amino acid sequences by decision trees over regular patterns | 1994-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3143041 | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202913 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694725 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4025924 | 1993-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985346 | 1992-06-27 | Paper |
| \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems | 1992-06-26 | Paper |
| Teachability in computational learning | 1991-01-01 | Paper |
| The lexicographically first maximal subgraph problems:P-completeness andNC algorithms | 1989-01-01 | Paper |
| A parallelizable lexicographically first maximal edge-induced subgraph problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795248 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789076 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783600 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746905 | 1985-01-01 | Paper |
| Alternating finite automata on \(\omega\)-words | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334086 | 1984-01-01 | Paper |
| Remarks on two-way automata with weak-counters | 1984-01-01 | Paper |
| Remarks on multihead pushdown automata and multihead stack automata | 1983-01-01 | Paper |
| Two-way deterministic multi-weak-counter machines | 1982-01-01 | Paper |
| A hierarchy theorem for multihead stack-counter automata | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948586 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960154 | 1982-01-01 | Paper |
| One-way weak-stack-counter automata | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949983 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949984 | 1980-01-01 | Paper |
| ON A LOWER BOUND OF SHEPHERDSON FUNCTION | 1979-01-01 | Paper |
| ON AN AUTOMATON WHICH RECOGNIZES A FAMILY OF AUTOMATA | 1978-01-01 | Paper |
| A NOTE ON THE REGURALITY OF FUZZY LANGUAGES | 1978-01-01 | Paper |
