Normal view MARC view ISBD view

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 online
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item 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.

Log in to your account to post a comment.