✦ LIBER ✦
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
✍ Scribed by Moosa, Johra Muhammad; Rahman, M. Sohel; Zohora, Fatema Tuz
- Book ID
- 122557720
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 212 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1570-8667
No coin nor oath required. For personal study only.