An improved algorithm to find the length of the longest common subsequence of two strings:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Pullman, Wash.
1987
|
| Schriftenreihe: | Washington State University <Pullman, Wash.> / Computer Science Department: CS
178 |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241211 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1987 |||| 00||| und d | ||
| 035 | |a (OCoLC)632898442 | ||
| 035 | |a (DE-599)BVBBV009241211 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-29T | ||
| 100 | 1 | |a Cross, George R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An improved algorithm to find the length of the longest common subsequence of two strings |c George R. Cross and Shufen Kuo |
| 264 | 1 | |a Pullman, Wash. |c 1987 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Washington State University <Pullman, Wash.> / Computer Science Department: CS |v 178 | |
| 700 | 1 | |a Kuo, Shufen |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: CS |t Washington State University <Pullman, Wash.> |v 178 |w (DE-604)BV008929975 |9 178 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006148039 | ||
Datensatz im Suchindex
| _version_ | 1804123687464468480 |
|---|---|
| any_adam_object | |
| author | Cross, George R. Kuo, Shufen |
| author_facet | Cross, George R. Kuo, Shufen |
| author_role | aut aut |
| author_sort | Cross, George R. |
| author_variant | g r c gr grc s k sk |
| building | Verbundindex |
| bvnumber | BV009241211 |
| ctrlnum | (OCoLC)632898442 (DE-599)BVBBV009241211 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00979nam a2200277 cb4500</leader><controlfield tag="001">BV009241211</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1987 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)632898442</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241211</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cross, George R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An improved algorithm to find the length of the longest common subsequence of two strings</subfield><subfield code="c">George R. Cross and Shufen Kuo</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pullman, Wash.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Washington State University <Pullman, Wash.> / Computer Science Department: CS</subfield><subfield code="v">178</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kuo, Shufen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">Washington State University <Pullman, Wash.></subfield><subfield code="v">178</subfield><subfield code="w">(DE-604)BV008929975</subfield><subfield code="9">178</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006148039</subfield></datafield></record></collection> |
| id | DE-604.BV009241211 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:44Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006148039 |
| oclc_num | 632898442 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 10 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series2 | Washington State University <Pullman, Wash.> / Computer Science Department: CS |
| spelling | Cross, George R. Verfasser aut An improved algorithm to find the length of the longest common subsequence of two strings George R. Cross and Shufen Kuo Pullman, Wash. 1987 10 S. txt rdacontent n rdamedia nc rdacarrier Washington State University <Pullman, Wash.> / Computer Science Department: CS 178 Kuo, Shufen Verfasser aut Computer Science Department: CS Washington State University <Pullman, Wash.> 178 (DE-604)BV008929975 178 |
| spellingShingle | Cross, George R. Kuo, Shufen An improved algorithm to find the length of the longest common subsequence of two strings |
| title | An improved algorithm to find the length of the longest common subsequence of two strings |
| title_auth | An improved algorithm to find the length of the longest common subsequence of two strings |
| title_exact_search | An improved algorithm to find the length of the longest common subsequence of two strings |
| title_full | An improved algorithm to find the length of the longest common subsequence of two strings George R. Cross and Shufen Kuo |
| title_fullStr | An improved algorithm to find the length of the longest common subsequence of two strings George R. Cross and Shufen Kuo |
| title_full_unstemmed | An improved algorithm to find the length of the longest common subsequence of two strings George R. Cross and Shufen Kuo |
| title_short | An improved algorithm to find the length of the longest common subsequence of two strings |
| title_sort | an improved algorithm to find the length of the longest common subsequence of two strings |
| volume_link | (DE-604)BV008929975 |
| work_keys_str_mv | AT crossgeorger animprovedalgorithmtofindthelengthofthelongestcommonsubsequenceoftwostrings AT kuoshufen animprovedalgorithmtofindthelengthofthelongestcommonsubsequenceoftwostrings |