Parallel string-matching with variable length don't cares:
Abstract: "String matching is the problem of finding all occurrences of a pattern P in a text T, where P and T are strings over a finite alphabet [sigma]. A variable length don't care is a special character, not belonging to [sigma], which can match any string in [sigma]*. The string match...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,24 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "String matching is the problem of finding all occurrences of a pattern P in a text T, where P and T are strings over a finite alphabet [sigma]. A variable length don't care is a special character, not belonging to [sigma], which can match any string in [sigma]*. The string matching problem with variable length don't cares is an extension of the classical string matching one in which the pattern P may contain an arbitrary number of don't cares. An optimal parallel algorithm is given for solving the string matching problem with variable length don't cares. The EREW pram model of parallel computers is used to obtain an O(log n) running time using O(mn/log n) processors, where m and n are, respectively, the length of P and T The proposed parallel algorithm is optimal since the fastest serial algorithm known so far has an O(mn) running time. |
| Beschreibung: | 13, [5] S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848156 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)28284997 | ||
| 035 | |a (DE-599)BVBBV010848156 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bertossi, Alan A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel string-matching with variable length don't cares |c A. A. Bertossi ; F. Logi |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 13, [5] S. |b graph. Darst. | ||
| 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,24 | |
| 520 | 3 | |a Abstract: "String matching is the problem of finding all occurrences of a pattern P in a text T, where P and T are strings over a finite alphabet [sigma]. A variable length don't care is a special character, not belonging to [sigma], which can match any string in [sigma]*. The string matching problem with variable length don't cares is an extension of the classical string matching one in which the pattern P may contain an arbitrary number of don't cares. An optimal parallel algorithm is given for solving the string matching problem with variable length don't cares. The EREW pram model of parallel computers is used to obtain an O(log n) running time using O(mn/log n) processors, where m and n are, respectively, the length of P and T | |
| 520 | 3 | |a The proposed parallel algorithm is optimal since the fastest serial algorithm known so far has an O(mn) running time. | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Pattern perception | |
| 700 | 1 | |a Logi, Filippo |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,24 |w (DE-604)BV010841375 |9 1991,24 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250795 | ||
Datensatz im Suchindex
| _version_ | 1804125334107324416 |
|---|---|
| any_adam_object | |
| author | Bertossi, Alan A. Logi, Filippo |
| author_facet | Bertossi, Alan A. Logi, Filippo |
| author_role | aut aut |
| author_sort | Bertossi, Alan A. |
| author_variant | a a b aa aab f l fl |
| building | Verbundindex |
| bvnumber | BV010848156 |
| ctrlnum | (OCoLC)28284997 (DE-599)BVBBV010848156 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01924nam a2200325 cb4500</leader><controlfield tag="001">BV010848156</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28284997</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848156</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></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bertossi, Alan A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel string-matching with variable length don't cares</subfield><subfield code="c">A. A. Bertossi ; F. Logi</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">13, [5] S.</subfield><subfield code="b">graph. Darst.</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,24</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "String matching is the problem of finding all occurrences of a pattern P in a text T, where P and T are strings over a finite alphabet [sigma]. A variable length don't care is a special character, not belonging to [sigma], which can match any string in [sigma]*. The string matching problem with variable length don't cares is an extension of the classical string matching one in which the pattern P may contain an arbitrary number of don't cares. An optimal parallel algorithm is given for solving the string matching problem with variable length don't cares. The EREW pram model of parallel computers is used to obtain an O(log n) running time using O(mn/log n) processors, where m and n are, respectively, the length of P and T</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The proposed parallel algorithm is optimal since the fastest serial algorithm known so far has an O(mn) running time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern perception</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Logi, Filippo</subfield><subfield code="e">Verfasser</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,24</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,24</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250795</subfield></datafield></record></collection> |
| id | DE-604.BV010848156 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250795 |
| oclc_num | 28284997 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13, [5] S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Bertossi, Alan A. Verfasser aut Parallel string-matching with variable length don't cares A. A. Bertossi ; F. Logi Pisa 1991 13, [5] S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,24 Abstract: "String matching is the problem of finding all occurrences of a pattern P in a text T, where P and T are strings over a finite alphabet [sigma]. A variable length don't care is a special character, not belonging to [sigma], which can match any string in [sigma]*. The string matching problem with variable length don't cares is an extension of the classical string matching one in which the pattern P may contain an arbitrary number of don't cares. An optimal parallel algorithm is given for solving the string matching problem with variable length don't cares. The EREW pram model of parallel computers is used to obtain an O(log n) running time using O(mn/log n) processors, where m and n are, respectively, the length of P and T The proposed parallel algorithm is optimal since the fastest serial algorithm known so far has an O(mn) running time. Computer algorithms Pattern perception Logi, Filippo Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,24 (DE-604)BV010841375 1991,24 |
| spellingShingle | Bertossi, Alan A. Logi, Filippo Parallel string-matching with variable length don't cares Computer algorithms Pattern perception |
| title | Parallel string-matching with variable length don't cares |
| title_auth | Parallel string-matching with variable length don't cares |
| title_exact_search | Parallel string-matching with variable length don't cares |
| title_full | Parallel string-matching with variable length don't cares A. A. Bertossi ; F. Logi |
| title_fullStr | Parallel string-matching with variable length don't cares A. A. Bertossi ; F. Logi |
| title_full_unstemmed | Parallel string-matching with variable length don't cares A. A. Bertossi ; F. Logi |
| title_short | Parallel string-matching with variable length don't cares |
| title_sort | parallel string matching with variable length don t cares |
| topic | Computer algorithms Pattern perception |
| topic_facet | Computer algorithms Pattern perception |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT bertossialana parallelstringmatchingwithvariablelengthdontcares AT logifilippo parallelstringmatchingwithvariablelengthdontcares |