Eintrag weiter verarbeiten
The shortest common supersequence problem over binary alphabet is NP-complete
Gespeichert in:
| Zeitschriftentitel: | Theoretical Computer Science |
|---|---|
| Personen und Körperschaften: | , |
| In: | Theoretical Computer Science, 16, 1981, 2, S. 187-198 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Elsevier BV
|
| Schlagwörter: |
| author_facet |
Räihä, Kari-Jouko Ukkonen, Esko Räihä, Kari-Jouko Ukkonen, Esko |
|---|---|
| author |
Räihä, Kari-Jouko Ukkonen, Esko |
| spellingShingle |
Räihä, Kari-Jouko Ukkonen, Esko Theoretical Computer Science The shortest common supersequence problem over binary alphabet is NP-complete General Computer Science Theoretical Computer Science |
| author_sort |
räihä, kari-jouko |
| spelling |
Räihä, Kari-Jouko Ukkonen, Esko 0304-3975 Elsevier BV General Computer Science Theoretical Computer Science http://dx.doi.org/10.1016/0304-3975(81)90075-x The shortest common supersequence problem over binary alphabet is NP-complete Theoretical Computer Science |
| doi_str_mv |
10.1016/0304-3975(81)90075-x |
| facet_avail |
Online Free |
| finc_class_facet |
Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMzA0LTM5NzUoODEpOTAwNzUteA |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMzA0LTM5NzUoODEpOTAwNzUteA |
| institution |
DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Rs1 DE-Pl11 DE-105 DE-14 DE-Ch1 DE-L229 |
| imprint |
Elsevier BV, 1981 |
| imprint_str_mv |
Elsevier BV, 1981 |
| issn |
0304-3975 |
| issn_str_mv |
0304-3975 |
| language |
English |
| mega_collection |
Elsevier BV (CrossRef) |
| match_str |
raiha1981theshortestcommonsupersequenceproblemoverbinaryalphabetisnpcomplete |
| publishDateSort |
1981 |
| publisher |
Elsevier BV |
| recordtype |
ai |
| record_format |
ai |
| series |
Theoretical Computer Science |
| source_id |
49 |
| title |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_unstemmed |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_full |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_fullStr |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_full_unstemmed |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_short |
The shortest common supersequence problem over binary alphabet is NP-complete |
| title_sort |
the shortest common supersequence problem over binary alphabet is np-complete |
| topic |
General Computer Science Theoretical Computer Science |
| url |
http://dx.doi.org/10.1016/0304-3975(81)90075-x |
| publishDate |
1981 |
| physical |
187-198 |
| description |
|
| container_issue |
2 |
| container_start_page |
187 |
| container_title |
Theoretical Computer Science |
| container_volume |
16 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792345816435785729 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T17:29:27.882Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=The+shortest+common+supersequence+problem+over+binary+alphabet+is+NP-complete&rft.date=1981-01-01&genre=article&issn=0304-3975&volume=16&issue=2&spage=187&epage=198&pages=187-198&jtitle=Theoretical+Computer+Science&atitle=The+shortest+common+supersequence+problem+over+binary+alphabet+is+NP-complete&aulast=Ukkonen&aufirst=Esko&rft_id=info%3Adoi%2F10.1016%2F0304-3975%2881%2990075-x&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792345816435785729 |
| author | Räihä, Kari-Jouko, Ukkonen, Esko |
| author_facet | Räihä, Kari-Jouko, Ukkonen, Esko, Räihä, Kari-Jouko, Ukkonen, Esko |
| author_sort | räihä, kari-jouko |
| container_issue | 2 |
| container_start_page | 187 |
| container_title | Theoretical Computer Science |
| container_volume | 16 |
| description | |
| doi_str_mv | 10.1016/0304-3975(81)90075-x |
| facet_avail | Online, Free |
| finc_class_facet | Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMzA0LTM5NzUoODEpOTAwNzUteA |
| imprint | Elsevier BV, 1981 |
| imprint_str_mv | Elsevier BV, 1981 |
| institution | DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Rs1, DE-Pl11, DE-105, DE-14, DE-Ch1, DE-L229 |
| issn | 0304-3975 |
| issn_str_mv | 0304-3975 |
| language | English |
| last_indexed | 2024-03-01T17:29:27.882Z |
| match_str | raiha1981theshortestcommonsupersequenceproblemoverbinaryalphabetisnpcomplete |
| mega_collection | Elsevier BV (CrossRef) |
| physical | 187-198 |
| publishDate | 1981 |
| publishDateSort | 1981 |
| publisher | Elsevier BV |
| record_format | ai |
| recordtype | ai |
| series | Theoretical Computer Science |
| source_id | 49 |
| spelling | Räihä, Kari-Jouko Ukkonen, Esko 0304-3975 Elsevier BV General Computer Science Theoretical Computer Science http://dx.doi.org/10.1016/0304-3975(81)90075-x The shortest common supersequence problem over binary alphabet is NP-complete Theoretical Computer Science |
| spellingShingle | Räihä, Kari-Jouko, Ukkonen, Esko, Theoretical Computer Science, The shortest common supersequence problem over binary alphabet is NP-complete, General Computer Science, Theoretical Computer Science |
| title | The shortest common supersequence problem over binary alphabet is NP-complete |
| title_full | The shortest common supersequence problem over binary alphabet is NP-complete |
| title_fullStr | The shortest common supersequence problem over binary alphabet is NP-complete |
| title_full_unstemmed | The shortest common supersequence problem over binary alphabet is NP-complete |
| title_short | The shortest common supersequence problem over binary alphabet is NP-complete |
| title_sort | the shortest common supersequence problem over binary alphabet is np-complete |
| title_unstemmed | The shortest common supersequence problem over binary alphabet is NP-complete |
| topic | General Computer Science, Theoretical Computer Science |
| url | http://dx.doi.org/10.1016/0304-3975(81)90075-x |