𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

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


Book ID
119291716
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
228 KB
Volume
29
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES