Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Information Processing Letters
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Covering and coloring polygon-circle graphs
Discrete Mathematics
More efficient algorithm for ordered tree inclusion
Journal of Algorithms
Pattern matching for permutations
Information Processing Letters
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the complexity of the crossing contact map pattern matching problem
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Approximation of RNA multiple structural alignment
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Longest common subsequences in permutations and maximum cliques in circle graphs
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximating the 2-interval pattern problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
What makes the arc-preserving subsequence problem hard?
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
LGM: mining frequent subgraphs from linear graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
| Hi-index | 0.00 |
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (k) for {k1/2 for {⊆, ≬}-structured patterns, and (iii) O(√k lg k) for {k is the size of the optimal solution and H (k) = Σi=1k 1/i is the k-th harmonic number.