New algorithms for the multiple longest common subsequence problems combining dynamic programming and heuristic methods
by Bepery, Chinmay.
Publisher: Dhaka Department of Computer Science & Engineering, BUET 2016Description: 100p.Subject(s): Heuristic algorithmsOnline resources: Click here to access onlineItem type | Current location | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
Thesis | Central Library, BUET Reference section | 519.3/BEP/2016 (Browse shelf) | 1 | Available | 114301 |
one CD-ROM
Includes bibliographies
There are no comments for this item.