Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
An approximate A* algorithm and its application to the SCS problem
Theoretical Computer Science
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
A probabilistic beam search approach to the shortest common supersequence problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
An algorithmic analysis of the honey-bee game
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Memetic algorithms with partial lamarckism for the shortest common supersequence problem
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A comparison of evolutionary approaches to the shortest common supersequence problem
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
An algorithmic analysis of the Honey-Bee game
Theoretical Computer Science
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
| Hi-index | 5.23 |