Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Edit distance between two RNA structures
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Computing similarity between RNA structures
Theoretical Computer Science
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
Local Similarity in RNA Secondary Structures
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Approximating the 2-interval pattern problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
How to compare arc-annotated sequences: the alignment hierarchy
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
An edit distance between RNA stem-loops
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Extending the hardness of RNA secondary structure comparison
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
The longest common subsequence problem with crossing-free arc-annotated sequences
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Hi-index | 0.00 |
HASH(0x2972ec0)