Find results with:

Search by date

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Approximation algorithms for the shortest superstring problem.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Call No.	QA76.9.A43 A76 1995
Author	Armen, Chris.
Title	Approximation algorithms for the shortest superstring problem.
Date	1995
Description	vii, 140 leaves : ill. 28 cm
Format	application/pdf
Subject	Algorithms. Pattern recognition systems.
College	Dartmouth College -- Department of Computer Science.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Copyright	All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means without permission in writing from the author.
DOI	http://dx.doi.org/10.1349/ddlp.1386

Title	Page 1
Full Text	Approximation Algorithms for the Shortest Super string Problem A Thesis Submitted to the Faculty in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Chris Armen Dartmouth College Hanover, New Hampshire July, 1995

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12