Finding the longest common nonsuperstring in linear time
Information Processing Letters
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hi-index | 5.23 |