| Publication | Date of Publication | Type |
|---|
Characterizing regular languages with polynomial densities
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Exact and approximate algorithms for unordered tree matching
IEEE Transactions on Systems, Man, and Cybernetics | 2017-10-09 | Paper |
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Algorithms for local similarity between forests
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Algorithms for Forest Local Similarity
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Algorithms for forest pattern matching
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Alignment between two multiple alignments
Combinatorial Pattern Matching | 2010-04-06 | Paper |
An effective algorithm for the peptide \textit{de novo} sequencing from MS/MS spectrum
Combinatorial Pattern Matching | 2010-04-06 | Paper |
On the longest common rigid subsequence problem
Algorithmica | 2010-02-23 | Paper |
A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
Journal of Combinatorial Optimization | 2009-07-13 | Paper |
On the similarity metric and the distance metric
Theoretical Computer Science | 2009-06-04 | Paper |
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
Lecture Notes in Computer Science | 2009-03-06 | Paper |
An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Space efficient algorithms for ordered tree comparison
Algorithmica | 2008-07-01 | Paper |
The longest common subsequence problem for arc-annotated sequences
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
WORD COMPLEXITY AND REPETITIONS IN WORDS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
scientific article; zbMATH DE number 2185648 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2185646 (Why is no real title available?)
| 2005-07-04 | Paper |
An effective algorithm for peptide \textit{de novo} sequencing from MS/MS spectra
Journal of Computer and System Sciences | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2089987 (Why is no real title available?)
| 2004-08-12 | Paper |
An index structure for data mining and clustering
Knowledge and Information Systems | 2003-01-08 | Paper |
scientific article; zbMATH DE number 1834687 (Why is no real title available?)
| 2002-11-25 | Paper |
Finding approximate patterns in undirected acyclic graphs
Pattern Recognition | 2002-09-29 | Paper |
Computing similarity between RNA structures
Theoretical Computer Science | 2002-07-15 | Paper |
A new algorithm for computing similarity between RNA structures
Information Sciences | 2002-05-14 | Paper |
Identifying consensus of trees through alignment
Information Sciences | 2001-10-01 | Paper |
scientific article; zbMATH DE number 1615278 (Why is no real title available?)
| 2001-07-08 | Paper |
Finding similar consensus between trees: An algorithm and a distance hierarchy
Pattern Recognition | 2001-03-12 | Paper |
Identifying approximately common substructures in trees based on a restricted edit distance
Information Sciences | 2000-06-04 | Paper |
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics | 1997-11-25 | Paper |
Algorithms for approximate graph matching
Information Sciences | 1997-06-16 | Paper |
Alignment of trees -- an alternative to tree edit
Theoretical Computer Science | 1997-02-28 | Paper |
ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
A constrained edit distance between unordered labeled trees
Algorithmica | 1996-03-18 | Paper |
Fast algorithms for minimum matrix norm with application in computer graphics
Algorithmica | 1996-02-22 | Paper |
Approximate Tree Matching in the Presence of Variable Length Don′t Cares
Journal of Algorithms | 1995-01-02 | Paper |
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters | 1994-04-05 | Paper |
Quantizer monotonicities and globally optimal scalar quantizer design
IEEE Transactions on Information Theory | 1994-02-07 | Paper |
On the editing distance between unordered labeled trees
Information Processing Letters | 1993-01-16 | Paper |
Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms | 1990-01-01 | Paper |
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
