𝔖 Bobbio Scriptorium

✦ LIBER ✦

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints

✍ Scribed by Wu, Yingjie; Wang, Lei; Zhu, Daxin; Wang, Xiaodong

Book ID: 122311544
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 321 KB
Volume: 26
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2014.01.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Outer Approximation Algorithm for Gen

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem

✍ Harold P. Benson 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 225 KB

[IEEE 2012 15th International Conference

[IEEE 2012 15th International Conference on Computer and Information Technology (ICCIT) - Chittagong, Bangladesh (2012.12.22-2012.12.24)] 2012 15th International Conference on Computer and Information Technology (ICCIT) - New efficient algorithms for the merged LCS problem with and without block constraints using sparse dynamic programming

✍ Rahman, A. H. M. Mahfuzur; Rahman, M. Sohel 📂 Article 📅 2012 🏛 IEEE ⚖ 218 KB