Cover image

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)

Holdings ( 1 )
Title notes
Comments ( 0 )

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

Browsing Central Library, BUET Shelves , Shelving location: Reference section Close shelf browser

Previous	No cover image available No cover image available		No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	519/BEY/1968 CRC handbook of tables for probability and statistics	519/UNI/2006 International Yearbook of industrial statistics 2006	519.23/NAS/2017 Inventory optimization for combined stock-dependent and stochastic demand	519.3/BEP/2016 New algorithms for the multiple longest common subsequence problems combining dynamic programming and heuristic methods	519.3/DEY/2018 Methodology for solving two person game under interval uncertainty	519.4/CMA Computers & mathematics with applications.	519.4/CMA Computers & mathematics with applications.	Next

one CD-ROM

Includes bibliographies

There are no comments for this item.

Log in to your account to post a comment.

Share