An Information Theoretic Lower Bound for the Longest Common Subsequence Problem

Simple item page
dc.citation.bibtexNametechreporten_US
dc.citation.issueNumber7705en_US
dc.citation.journalTitleRice University ECE Technical Reporten_US
dc.contributor.authorHirschberg, D.S.en_US
dc.date.accessioned2007-10-31T00:47:00Z
dc.date.available2007-10-31T00:47:00Z
dc.date.issued1977-04-20
dc.date.modified2003-10-22en_US
dc.date.submitted2003-10-22en_US
dc.descriptionTech Reporten_US
dc.description.abstractWe shall derive a lower on the number of "less-than-equal-greater than" comparisons required to solve the longest common subsequence (LCS) problem.en_US
dc.description.sponsorshipNational Science Foundationen_US
dc.identifier.citationD. Hirschberg, "An Information Theoretic Lower Bound for the Longest Common Subsequence Problem," <i>Rice University ECE Technical Report,</i> no. 7705, 1977.
dc.identifier.urihttps://hdl.handle.net/1911/19954
dc.language.isoeng
dc.subjectsequence*
dc.subject.keywordsequenceen_US
dc.titleAn Information Theoretic Lower Bound for the Longest Common Subsequence Problemen_US
dc.typeReport
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hir1977Apr9AnInforma.PDF
Size:
161.68 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications