The following pages link to Kaizhong Zhang (Q162238):
Displaying 47 items.
- (Q192665) (redirect page) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- An index structure for data mining and clustering (Q698712) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- On the similarity metric and the distance metric (Q1019717) (← links)
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method (Q1029709) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Computing similarity between RNA structures (Q1605306) (← links)
- An effective algorithm for peptide \textit{de novo} sequencing from MS/MS spectra (Q1775776) (← links)
- Fast algorithms for minimum matrix norm with application in computer graphics (Q1907031) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- Algorithms for local similarity between forests (Q2436665) (← links)
- (Q2723948) (← links)
- (Q3024815) (← links)
- (Q3024817) (← links)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems (Q3034830) (← links)
- Algorithms for Forest Local Similarity (Q3167358) (← links)
- Alignment between Two Multiple Alignments (Q3550840) (← links)
- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum (Q3550841) (← links)
- Algorithms for Forest Pattern Matching (Q3575232) (← links)
- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method (Q3608829) (← links)
- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity (Q3608872) (← links)
- Quantizer monotonicities and globally optimal scalar quantizer design (Q4277167) (← links)
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares (Q4289840) (← links)
- (Q4779184) (← links)
- (Q4808652) (← links)
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367) (← links)
- Characterizing regular languages with polynomial densities (Q5096862) (← links)
- Exact and approximate algorithms for unordered tree matching (Q5365715) (← links)
- AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE (Q5462119) (← links)
- Implementation and Application of Automata (Q5463976) (← links)
- WORD COMPLEXITY AND REPETITIONS IN WORDS (Q5696964) (← links)
- Computational Science – ICCS 2005 (Q5709419) (← links)
- Combinatorial Pattern Matching (Q5713543) (← links)
- Fast algorithms for the unit cost editing distance between trees (Q5750416) (← links)
- Algorithms and Computation (Q5897871) (← links)
- Finding similar consensus between trees: An algorithm and a distance hierarchy (Q5926038) (← links)
- Identifying consensus of trees through alignment (Q5938834) (← links)
- A new algorithm for computing similarity between RNA structures (Q5956864) (← links)
- Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
