Finding all the palindromes of a string in linear time and space:
Abstract: "We give an O(n) time algorithm to determine all the palindromes contained in arbitrary positions of a given string of length n."
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English Italian |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,3 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We give an O(n) time algorithm to determine all the palindromes contained in arbitrary positions of a given string of length n." |
| Beschreibung: | 5 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010843896 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960711s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28227674 | ||
| 035 | |a (DE-599)BVBBV010843896 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng |a ita | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a De Jaco, Bettina |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Finding all the palindromes of a string in linear time and space |c B. de Jaco ; F. Luccio |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,3 | |
| 520 | 3 | |a Abstract: "We give an O(n) time algorithm to determine all the palindromes contained in arbitrary positions of a given string of length n." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Palindromes | |
| 650 | 4 | |a Pattern perception | |
| 700 | 1 | |a Luccio, Fabrizio |d 1938- |e Verfasser |0 (DE-588)128216840 |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,3 |w (DE-604)BV010841375 |9 1991,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007249087 | ||
Datensatz im Suchindex
| _version_ | 1804125331795214336 |
|---|---|
| any_adam_object | |
| author | De Jaco, Bettina Luccio, Fabrizio 1938- |
| author_GND | (DE-588)128216840 |
| author_facet | De Jaco, Bettina Luccio, Fabrizio 1938- |
| author_role | aut aut |
| author_sort | De Jaco, Bettina |
| author_variant | j b d jb jbd f l fl |
| building | Verbundindex |
| bvnumber | BV010843896 |
| ctrlnum | (OCoLC)28227674 (DE-599)BVBBV010843896 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01230nam a2200325 cb4500</leader><controlfield tag="001">BV010843896</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960711s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28227674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010843896</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="0" ind2=" "><subfield code="a">eng</subfield><subfield code="a">ita</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">De Jaco, Bettina</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding all the palindromes of a string in linear time and space</subfield><subfield code="c">B. de Jaco ; F. Luccio</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 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">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,3</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We give an O(n) time algorithm to determine all the palindromes contained in arbitrary positions of a given string of length n."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Palindromes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern perception</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luccio, Fabrizio</subfield><subfield code="d">1938-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128216840</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,3</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007249087</subfield></datafield></record></collection> |
| id | DE-604.BV010843896 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:52Z |
| institution | BVB |
| language | English Italian |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007249087 |
| oclc_num | 28227674 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 5 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | De Jaco, Bettina Verfasser aut Finding all the palindromes of a string in linear time and space B. de Jaco ; F. Luccio Pisa 1991 5 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,3 Abstract: "We give an O(n) time algorithm to determine all the palindromes contained in arbitrary positions of a given string of length n." Computer algorithms Palindromes Pattern perception Luccio, Fabrizio 1938- Verfasser (DE-588)128216840 aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,3 (DE-604)BV010841375 1991,3 |
| spellingShingle | De Jaco, Bettina Luccio, Fabrizio 1938- Finding all the palindromes of a string in linear time and space Computer algorithms Palindromes Pattern perception |
| title | Finding all the palindromes of a string in linear time and space |
| title_auth | Finding all the palindromes of a string in linear time and space |
| title_exact_search | Finding all the palindromes of a string in linear time and space |
| title_full | Finding all the palindromes of a string in linear time and space B. de Jaco ; F. Luccio |
| title_fullStr | Finding all the palindromes of a string in linear time and space B. de Jaco ; F. Luccio |
| title_full_unstemmed | Finding all the palindromes of a string in linear time and space B. de Jaco ; F. Luccio |
| title_short | Finding all the palindromes of a string in linear time and space |
| title_sort | finding all the palindromes of a string in linear time and space |
| topic | Computer algorithms Palindromes Pattern perception |
| topic_facet | Computer algorithms Palindromes Pattern perception |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT dejacobettina findingallthepalindromesofastringinlineartimeandspace AT lucciofabrizio findingallthepalindromesofastringinlineartimeandspace |