COMPUTING A LONGEST COMMON SUBSEQUENCE FOR A SET OF STRINGS

Full metadata record

DC Field	Value	Language
dc.contributor.author	HSU, WJ	en_US
dc.contributor.author	DU, MW	en_US
dc.date.accessioned	2014-12-08T15:06:17Z	-
dc.date.available	2014-12-08T15:06:17Z	-
dc.date.issued	1984	en_US
dc.identifier.issn	0006-3835	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4866	-
dc.identifier.uri	http://dx.doi.org/10.1007/BF01934514	en_US
dc.language.iso	en_US	en_US
dc.title	COMPUTING A LONGEST COMMON SUBSEQUENCE FOR A SET OF STRINGS	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/BF01934514	en_US
dc.identifier.journal	BIT	en_US
dc.citation.volume	24	en_US
dc.citation.issue	1	en_US
dc.citation.spage	45	en_US
dc.citation.epage	59	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1984SR65400005	-
dc.citation.woscount	27	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.