Substring search and repeat search using factor oracles
We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms.
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2005, Vol.93 (6), p.269-274 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 274 |
|---|---|
| container_issue | 6 |
| container_start_page | 269 |
| container_title | Information processing letters |
| container_volume | 93 |
| creator | Kato, Ryoichi Watanabe, Osamu |
| description | We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms. |
| doi_str_mv | 10.1016/j.ipl.2004.11.011 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237285090</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019004003564</els_id><sourcerecordid>796535241</sourcerecordid><originalsourceid>FETCH-LOGICAL-c493t-58c32828aba9cef9dd0c4d4e9bbc7959ddfc8384b71ab0cc5bf0b6b4b1f53c563</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AG9F8Ng60-_gSRa_YMGDeg7JNNGU2takFfz3ZumKN0_DzLzvvMzD2DlCgoDlVZvYsUtSgDxBTADxgK2wrtK4ROSHbAWQQgzI4ZideN8CQJln1YpVz7Pyk7P9W-S1dPQeyb6JnB61nH4ns9-tjaRpcNHgJHXan7IjIzuvz_Z1zV7vbl82D_H26f5xc7ONKefZFBc1ZWmd1lJJTtrwpgHKm1xzpajiRegN1VmdqwqlAqJCGVClyhWaIqOizNbsYrk7uuFz1n4S7TC7PkSKNKvSugAOQYSLiNzgvdNGjM5-SPctEMQOj2hFwCN2eASiCHiC53J_WHqSnXGyJ-v_jGWBZYAWdNeLTocvv6x2wpPVPenGOk2TaAb7T8oPxuB6SQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237285090</pqid></control><display><type>article</type><title>Substring search and repeat search using factor oracles</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Kato, Ryoichi ; Watanabe, Osamu</creator><creatorcontrib>Kato, Ryoichi ; Watanabe, Osamu</creatorcontrib><description>We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2004.11.011</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Automata. Abstract machines. Turing machines ; Automation ; Automaton ; Computer science; control theory; systems ; Exact sciences and technology ; Full text ; Mathematical analysis ; Repetition search ; Searches ; Studies ; Substring search ; Suffix-trees ; Theoretical computing</subject><ispartof>Information processing letters, 2005, Vol.93 (6), p.269-274</ispartof><rights>2004 Elsevier B.V.</rights><rights>2005 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 31, 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c493t-58c32828aba9cef9dd0c4d4e9bbc7959ddfc8384b71ab0cc5bf0b6b4b1f53c563</citedby><cites>FETCH-LOGICAL-c493t-58c32828aba9cef9dd0c4d4e9bbc7959ddfc8384b71ab0cc5bf0b6b4b1f53c563</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ipl.2004.11.011$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,4022,27922,27923,27924,45994</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16516002$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kato, Ryoichi</creatorcontrib><creatorcontrib>Watanabe, Osamu</creatorcontrib><title>Substring search and repeat search using factor oracles</title><title>Information processing letters</title><description>We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Automation</subject><subject>Automaton</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Full text</subject><subject>Mathematical analysis</subject><subject>Repetition search</subject><subject>Searches</subject><subject>Studies</subject><subject>Substring search</subject><subject>Suffix-trees</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AG9F8Ng60-_gSRa_YMGDeg7JNNGU2takFfz3ZumKN0_DzLzvvMzD2DlCgoDlVZvYsUtSgDxBTADxgK2wrtK4ROSHbAWQQgzI4ZideN8CQJln1YpVz7Pyk7P9W-S1dPQeyb6JnB61nH4ns9-tjaRpcNHgJHXan7IjIzuvz_Z1zV7vbl82D_H26f5xc7ONKefZFBc1ZWmd1lJJTtrwpgHKm1xzpajiRegN1VmdqwqlAqJCGVClyhWaIqOizNbsYrk7uuFz1n4S7TC7PkSKNKvSugAOQYSLiNzgvdNGjM5-SPctEMQOj2hFwCN2eASiCHiC53J_WHqSnXGyJ-v_jGWBZYAWdNeLTocvv6x2wpPVPenGOk2TaAb7T8oPxuB6SQ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Kato, Ryoichi</creator><creator>Watanabe, Osamu</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2005</creationdate><title>Substring search and repeat search using factor oracles</title><author>Kato, Ryoichi ; Watanabe, Osamu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c493t-58c32828aba9cef9dd0c4d4e9bbc7959ddfc8384b71ab0cc5bf0b6b4b1f53c563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Automation</topic><topic>Automaton</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Full text</topic><topic>Mathematical analysis</topic><topic>Repetition search</topic><topic>Searches</topic><topic>Studies</topic><topic>Substring search</topic><topic>Suffix-trees</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kato, Ryoichi</creatorcontrib><creatorcontrib>Watanabe, Osamu</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kato, Ryoichi</au><au>Watanabe, Osamu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Substring search and repeat search using factor oracles</atitle><jtitle>Information processing letters</jtitle><date>2005</date><risdate>2005</risdate><volume>93</volume><issue>6</issue><spage>269</spage><epage>274</epage><pages>269-274</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2004.11.011</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2005, Vol.93 (6), p.269-274 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237285090 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Automata. Abstract machines. Turing machines Automation Automaton Computer science control theory systems Exact sciences and technology Full text Mathematical analysis Repetition search Searches Studies Substring search Suffix-trees Theoretical computing |
| title | Substring search and repeat search using factor oracles |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T11%3A52%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Substring%20search%20and%20repeat%20search%20using%20factor%20oracles&rft.jtitle=Information%20processing%20letters&rft.au=Kato,%20Ryoichi&rft.date=2005&rft.volume=93&rft.issue=6&rft.spage=269&rft.epage=274&rft.pages=269-274&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2004.11.011&rft_dat=%3Cproquest_cross%3E796535241%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=237285090&rft_id=info:pmid/&rft_els_id=S0020019004003564&rfr_iscdi=true |