✦ LIBER ✦

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion

✍ Scribed by Ann, Hsing-Yen; Yang, Chang-Biau; Tseng, Chiou-Ting

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic-time algorithm for a string co

✍ Sebastian Deorowicz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 117 KB

An efficient dynamic programming algorit

✍ Wu, Yingjie; Wang, Lei; Zhu, Daxin; Wang, Xiaodong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 321 KB

An Efficient Polynomial Time Approximati

✍ Hassin, Refael; Levin, Asaf 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 143 KB

A Polynomial-Time Algorithm for the Knap

✍ Hirschberg, D. S.; Wong, C. K. 📂 Article 📅 1976 🏛 Association for Computing Machinery 🌐 English ⚖ 458 KB

Computational experience with a polynomi

✍ Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 572 KB

An efficient algorithm for the multi-mod

✍ Najid, Najib M.; Arroub, Marouane 📂 Article 📅 2010 🏛 Inderscience Publishers 🌐 English ⚖ 316 KB