| Publication | Date of Publication | Type |
|---|
| Characterizing regular languages with polynomial densities | 2022-08-18 | Paper |
| Exact and approximate algorithms for unordered tree matching | 2017-10-09 | Paper |
| An improved algorithm for tree edit distance with applications for RNA secondary structure comparison | 2014-06-24 | Paper |
| Algorithms for local similarity between forests | 2014-02-25 | Paper |
| Algorithms for Forest Local Similarity | 2012-11-02 | Paper |
| Algorithms for Forest Pattern Matching | 2010-07-26 | Paper |
| Alignment between Two Multiple Alignments | 2010-04-06 | Paper |
| An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum | 2010-04-06 | Paper |
| On the longest common rigid subsequence problem | 2010-02-23 | Paper |
| A new quartet approach for reconstructing phylogenetic trees: Quartet joining method | 2009-07-13 | Paper |
| On the similarity metric and the distance metric | 2009-06-04 | Paper |
| A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method | 2009-03-06 | Paper |
| An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity | 2009-03-06 | Paper |
| Space efficient algorithms for ordered tree comparison | 2008-07-01 | Paper |
| The longest common subsequence problem for arc-annotated sequences | 2007-04-26 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| WORD COMPLEXITY AND REPETITIONS IN WORDS | 2005-10-19 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024817 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024815 | 2005-07-04 | Paper |
| An effective algorithm for peptide \textit{de novo} sequencing from MS/MS spectra | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808652 | 2004-08-12 | Paper |
| An index structure for data mining and clustering | 2003-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779184 | 2002-11-25 | Paper |
| Finding approximate patterns in undirected acyclic graphs | 2002-09-29 | Paper |
| Computing similarity between RNA structures | 2002-07-15 | Paper |
| A new algorithm for computing similarity between RNA structures | 2002-05-14 | Paper |
| Identifying consensus of trees through alignment | 2001-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723948 | 2001-07-08 | Paper |
| Finding similar consensus between trees: An algorithm and a distance hierarchy | 2001-03-12 | Paper |
| Identifying approximately common substructures in trees based on a restricted edit distance | 2000-06-04 | Paper |
| On the complexity of comparing evolutionary trees | 1997-11-25 | Paper |
| Algorithms for approximate graph matching | 1997-06-16 | Paper |
| Alignment of trees -- an alternative to tree edit | 1997-02-28 | Paper |
| ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS | 1996-11-26 | Paper |
| A constrained edit distance between unordered labeled trees | 1996-03-18 | Paper |
| Fast algorithms for minimum matrix norm with application in computer graphics | 1996-02-22 | Paper |
| Approximate Tree Matching in the Presence of Variable Length Don′t Cares | 1995-01-02 | Paper |
| Some MAX SNP-hard results concerning unordered labeled trees | 1994-04-05 | Paper |
| Quantizer monotonicities and globally optimal scalar quantizer design | 1994-02-07 | Paper |
| On the editing distance between unordered labeled trees | 1993-01-16 | Paper |
| Fast algorithms for the unit cost editing distance between trees | 1990-01-01 | Paper |
| Simple Fast Algorithms for the Editing Distance between Trees and Related Problems | 1989-01-01 | Paper |
