Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
Journals and Conferences
Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of a given string set. The SCS problem has an enormous application of data compression, query optimization in the database and different bioinformatics activities. Due to NP-hardness, the exact algorithms fail to compute SCS for… (More)