Efficient comparison based string matching:
Abstract: "We study the exact number of symbol comparisons that are required to solve the string matching problem and present a family of efficient algorithms. Unlike previous string matching algorithms, the algorithms in this family do not 'forget' results of comparisons, what makes...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,49 |
| Subjects: | |
| Summary: | Abstract: "We study the exact number of symbol comparisons that are required to solve the string matching problem and present a family of efficient algorithms. Unlike previous string matching algorithms, the algorithms in this family do not 'forget' results of comparisons, what makes their analysis much simpler. In particular, we give a linear-time algorithm that finds all occurences of a pattern of length m in a text of length n in [formula] comparisons. The pattern preprocessing takes linear time and makes at most 2m comparisons. This algorithm establishes that, in general, searching for a long pattern is easier than searching for a short one We also show that any algorithm in the family of the algorithms presented must make at least [formula] symbol comparisons, for m = 2[superscript k] - 1 and any integer k [> or =] 1. |
| Physical Description: | 19 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015836 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28981980 | ||
| 035 | |a (DE-599)BVBBV009015836 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Breslauer, Dany |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient comparison based string matching |c Dany Breslauer ; Zvi Galil |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,49 | |
| 520 | 3 | |a Abstract: "We study the exact number of symbol comparisons that are required to solve the string matching problem and present a family of efficient algorithms. Unlike previous string matching algorithms, the algorithms in this family do not 'forget' results of comparisons, what makes their analysis much simpler. In particular, we give a linear-time algorithm that finds all occurences of a pattern of length m in a text of length n in [formula] comparisons. The pattern preprocessing takes linear time and makes at most 2m comparisons. This algorithm establishes that, in general, searching for a long pattern is easier than searching for a short one | |
| 520 | 3 | |a We also show that any algorithm in the family of the algorithms presented must make at least [formula] symbol comparisons, for m = 2[superscript k] - 1 and any integer k [> or =] 1. | |
| 650 | 4 | |a Computer algorithms | |
| 700 | 1 | |a Galil, Zvi |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,49 |w (DE-604)BV008928356 |9 92,49 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961366 | ||
Record in the Search Index
| _version_ | 1804123365190926336 |
|---|---|
| any_adam_object | |
| author | Breslauer, Dany Galil, Zvi |
| author_facet | Breslauer, Dany Galil, Zvi |
| author_role | aut aut |
| author_sort | Breslauer, Dany |
| author_variant | d b db z g zg |
| building | Verbundindex |
| bvnumber | BV009015836 |
| ctrlnum | (OCoLC)28981980 (DE-599)BVBBV009015836 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01853nam a2200313 cb4500</leader><controlfield tag="001">BV009015836</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28981980</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015836</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Breslauer, Dany</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient comparison based string matching</subfield><subfield code="c">Dany Breslauer ; Zvi Galil</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,49</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study the exact number of symbol comparisons that are required to solve the string matching problem and present a family of efficient algorithms. Unlike previous string matching algorithms, the algorithms in this family do not 'forget' results of comparisons, what makes their analysis much simpler. In particular, we give a linear-time algorithm that finds all occurences of a pattern of length m in a text of length n in [formula] comparisons. The pattern preprocessing takes linear time and makes at most 2m comparisons. This algorithm establishes that, in general, searching for a long pattern is easier than searching for a short one</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We also show that any algorithm in the family of the algorithms presented must make at least [formula] symbol comparisons, for m = 2[superscript k] - 1 and any integer k [> or =] 1.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Galil, Zvi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,49</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,49</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961366</subfield></datafield></record></collection> |
| id | DE-604.BV009015836 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961366 |
| oclc_num | 28981980 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Breslauer, Dany Verfasser aut Efficient comparison based string matching Dany Breslauer ; Zvi Galil Amsterdam 1992 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,49 Abstract: "We study the exact number of symbol comparisons that are required to solve the string matching problem and present a family of efficient algorithms. Unlike previous string matching algorithms, the algorithms in this family do not 'forget' results of comparisons, what makes their analysis much simpler. In particular, we give a linear-time algorithm that finds all occurences of a pattern of length m in a text of length n in [formula] comparisons. The pattern preprocessing takes linear time and makes at most 2m comparisons. This algorithm establishes that, in general, searching for a long pattern is easier than searching for a short one We also show that any algorithm in the family of the algorithms presented must make at least [formula] symbol comparisons, for m = 2[superscript k] - 1 and any integer k [> or =] 1. Computer algorithms Galil, Zvi Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,49 (DE-604)BV008928356 92,49 |
| spellingShingle | Breslauer, Dany Galil, Zvi Efficient comparison based string matching Computer algorithms |
| title | Efficient comparison based string matching |
| title_auth | Efficient comparison based string matching |
| title_exact_search | Efficient comparison based string matching |
| title_full | Efficient comparison based string matching Dany Breslauer ; Zvi Galil |
| title_fullStr | Efficient comparison based string matching Dany Breslauer ; Zvi Galil |
| title_full_unstemmed | Efficient comparison based string matching Dany Breslauer ; Zvi Galil |
| title_short | Efficient comparison based string matching |
| title_sort | efficient comparison based string matching |
| topic | Computer algorithms |
| topic_facet | Computer algorithms |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT breslauerdany efficientcomparisonbasedstringmatching AT galilzvi efficientcomparisonbasedstringmatching |