An Information Theoretic Lower Bound for the Longest Common Subsequence Problem
dc.citation.bibtexName | techreport | en_US |
dc.citation.issueNumber | 7705 | en_US |
dc.citation.journalTitle | Rice University ECE Technical Report | en_US |
dc.contributor.author | Hirschberg, D.S. | en_US |
dc.date.accessioned | 2007-10-31T00:47:00Z | |
dc.date.available | 2007-10-31T00:47:00Z | |
dc.date.issued | 1977-04-20 | |
dc.date.modified | 2003-10-22 | en_US |
dc.date.submitted | 2003-10-22 | en_US |
dc.description | Tech Report | en_US |
dc.description.abstract | We 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.sponsorship | National Science Foundation | en_US |
dc.identifier.citation | D. Hirschberg, "An Information Theoretic Lower Bound for the Longest Common Subsequence Problem," <i>Rice University ECE Technical Report,</i> no. 7705, 1977. | |
dc.identifier.uri | https://hdl.handle.net/1911/19954 | |
dc.language.iso | eng | |
dc.subject | sequence | * |
dc.subject.keyword | sequence | en_US |
dc.title | An Information Theoretic Lower Bound for the Longest Common Subsequence Problem | en_US |
dc.type | Report | |
dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1