Factor oracle : A new structure for pattern matching
We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 310 |
|---|---|
| container_issue | |
| container_start_page | 295 |
| container_title | |
| container_volume | 1725 |
| creator | ALLAUZEN, C CROCHEMORE, M RAFFINOT, M |
| description | We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as effecient as the ones that already exist using less memory and being more easy to implement. |
| doi_str_mv | 10.1007/3-540-47849-3_18 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1172205</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00619846v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h260t-4319ed0f193ea5902f5884fc45f75796b84032015fed79f8e6da3508183721193</originalsourceid><addsrcrecordid>eNo9jEtLAzEUhYMPsNbuXWbhxkX03tw83ZXSWqHgRtdDnCZ2ZDotmVTx3ztScXXgnO87jF0j3CGAvSehFQhlnfKCKnQnbIQGURApf8om3joaAGOMV3TGRkAghbeKLthl338AgLRejphahLrsMt_lULeRP_Ap7-IX70s-1OWQI0_DuA-lxNzxbSj1puner9h5Cm0fJ385Zq-L-ctsKVbPj0-z6UpspIEiFKGPa0joKQbtQSbtnEq10slq682bU0ASUKe4tj65aNaBNDh0ZCUO1pjdHn83oa32udmG_F3tQlMtp6vqtwMw6J0ynziwN0d2H_o6tCmHrm76fwvRSgmafgD2ZFYe</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Factor oracle : A new structure for pattern matching</title><source>Springer Books</source><creator>ALLAUZEN, C ; CROCHEMORE, M ; RAFFINOT, M</creator><creatorcontrib>ALLAUZEN, C ; CROCHEMORE, M ; RAFFINOT, M</creatorcontrib><description>We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as effecient as the ones that already exist using less memory and being more easy to implement.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540666943</identifier><identifier>ISBN: 354066694X</identifier><identifier>EISSN: 1611-3349</identifier><identifier>DOI: 10.1007/3-540-47849-3_18</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer Science ; Computer science; control theory; systems ; Data Structures and Algorithms ; Exact sciences and technology ; Theoretical computing</subject><ispartof>26th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'99), 1999, Vol.1725, p.295-310</ispartof><rights>2000 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-1087-1419</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,309,310,780,784,789,790,885,4049,4050,27924</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1172205$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00619846$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>ALLAUZEN, C</creatorcontrib><creatorcontrib>CROCHEMORE, M</creatorcontrib><creatorcontrib>RAFFINOT, M</creatorcontrib><title>Factor oracle : A new structure for pattern matching</title><title>26th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'99)</title><description>We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as effecient as the ones that already exist using less memory and being more easy to implement.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Data Structures and Algorithms</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540666943</isbn><isbn>354066694X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNo9jEtLAzEUhYMPsNbuXWbhxkX03tw83ZXSWqHgRtdDnCZ2ZDotmVTx3ztScXXgnO87jF0j3CGAvSehFQhlnfKCKnQnbIQGURApf8om3joaAGOMV3TGRkAghbeKLthl338AgLRejphahLrsMt_lULeRP_Ap7-IX70s-1OWQI0_DuA-lxNzxbSj1puner9h5Cm0fJ385Zq-L-ctsKVbPj0-z6UpspIEiFKGPa0joKQbtQSbtnEq10slq682bU0ASUKe4tj65aNaBNDh0ZCUO1pjdHn83oa32udmG_F3tQlMtp6vqtwMw6J0ynziwN0d2H_o6tCmHrm76fwvRSgmafgD2ZFYe</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>ALLAUZEN, C</creator><creator>CROCHEMORE, M</creator><creator>RAFFINOT, M</creator><general>Springer</general><general>Springer-Verlag</general><scope>IQODW</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-1087-1419</orcidid></search><sort><creationdate>1999</creationdate><title>Factor oracle : A new structure for pattern matching</title><author>ALLAUZEN, C ; CROCHEMORE, M ; RAFFINOT, M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h260t-4319ed0f193ea5902f5884fc45f75796b84032015fed79f8e6da3508183721193</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Data Structures and Algorithms</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ALLAUZEN, C</creatorcontrib><creatorcontrib>CROCHEMORE, M</creatorcontrib><creatorcontrib>RAFFINOT, M</creatorcontrib><collection>Pascal-Francis</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ALLAUZEN, C</au><au>CROCHEMORE, M</au><au>RAFFINOT, M</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Factor oracle : A new structure for pattern matching</atitle><btitle>26th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'99)</btitle><date>1999</date><risdate>1999</risdate><volume>1725</volume><spage>295</spage><epage>310</epage><pages>295-310</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540666943</isbn><isbn>354066694X</isbn><abstract>We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as effecient as the ones that already exist using less memory and being more easy to implement.</abstract><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/3-540-47849-3_18</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0003-1087-1419</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | 26th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'99), 1999, Vol.1725, p.295-310 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1172205 |
| source | Springer Books |
| subjects | Applied sciences Automata. Abstract machines. Turing machines Computer Science Computer science control theory systems Data Structures and Algorithms Exact sciences and technology Theoretical computing |
| title | Factor oracle : A new structure for pattern matching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T00%3A50%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Factor%20oracle%20:%20A%20new%20structure%20for%20pattern%20matching&rft.btitle=26th%20Seminar%20on%20Current%20Trends%20in%20Theory%20and%20Practice%20of%20Informatics%20(SOFSEM'99)&rft.au=ALLAUZEN,%20C&rft.date=1999&rft.volume=1725&rft.spage=295&rft.epage=310&rft.pages=295-310&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540666943&rft.isbn_list=354066694X&rft_id=info:doi/10.1007/3-540-47849-3_18&rft_dat=%3Chal_pasca%3Eoai_HAL_hal_00619846v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |