On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings

Authors:
Robert W. Irving;Campbell Fraser
Affiliations:
-;-
Venue:
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Year:
1993

An approximation algorithm for the shortest common supersequence problem: an experimental analysis

Proceedings of the 2001 ACM symposium on Applied computing
About the design of oligo-chips

Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
A Multi-objective Genetic Algorithm Based Approach to the Optimization of Oligonucleotide Microarray Production Process

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
About the design of oligo-chips

Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
An enhanced beam search algorithm for the Shortest Common Supersequence Problem

Engineering Applications of Artificial Intelligence

Hi-index	0.00