Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion.
Hsing-Yen AnnChang-Biau YangChiou-Ting TsengPublished in: J. Comb. Optim. (2014)
Keyphrases
- computationally efficient
- computational complexity
- theoretical analysis
- computationally intensive
- data structure
- computationally expensive
- computationally complex
- highly efficient
- worst case
- machine learning methods
- highly scalable
- efficient solutions
- computationally demanding
- data sets
- benchmark datasets
- upper bound
- efficient implementation
- significant improvement
- space complexity
- learning algorithm
- complexity analysis
- linear space
- longest common subsequence