ACM Transactions on Database Systems (TODS)
Data compression: methods and theory
Data compression: methods and theory
Theory and algorithms for plan merging
Artificial Intelligence
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Some Approximations for Shortest Common Nonsubsequences and Supersequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Improved Approximation Results on the Shortest Common Supersequence Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
The multiple sequence sets: problem and heuristic algorithms
Journal of Combinatorial Optimization
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
Engineering Applications of Artificial Intelligence
A Novel Algorithm for Fast Synthesis of DNA Probes on Microarrays
ACM Journal on Emerging Technologies in Computing Systems (JETC)
| Hi-index | 0.00 |