Linear-time construction of suffix arrays: (Extended abstract)
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 | 199 |
|---|---|
| container_issue | |
| container_start_page | 186 |
| container_title | |
| container_volume | |
| creator | DONG KYUE KIM JEONG SEOP SIM PARK, Heejin PARK, Kunsoo |
| description | |
| doi_str_mv | 10.1007/3-540-44888-8_14 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_15759323</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>15759323</sourcerecordid><originalsourceid>FETCH-LOGICAL-p227t-629446cb8d087109c78ffd2ed623c04093985c3e470331a47da57f0c2b4da6f83</originalsourceid><addsrcrecordid>eNotjjtrwzAUhUUfUDfN3tFLoR3UXunKltShEEL6AEOXdjbXeoBLYgfJgeTf19Ce5Qzf4eMwdivgUQDoJ-SVAq6UMYabVqgzVohaCI6o7Dm7xpkqQCHqC1YAguRWK7xiy5x_YI60EgQW7KXph0CJT_0ulG4c8pQOburHoRxjmQ8x9seSUqJTfi7vN8cpDD74krp5R256uGGXkbY5LP97wb5fN1_rd958vn2sVw3fS6knXkurVO0648FoAdZpE6OXwdcS3fzTojWVw6A0IApS2lOlIzjZKU91NLhgd3_ePWVH25hocH1u96nfUTq1otKVRYn4C3XiTWk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Linear-time construction of suffix arrays: (Extended abstract)</title><source>Springer Books</source><creator>DONG KYUE KIM ; JEONG SEOP SIM ; PARK, Heejin ; PARK, Kunsoo</creator><creatorcontrib>DONG KYUE KIM ; JEONG SEOP SIM ; PARK, Heejin ; PARK, Kunsoo</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540403116</identifier><identifier>ISBN: 9783540403111</identifier><identifier>EISSN: 1611-3349</identifier><identifier>DOI: 10.1007/3-540-44888-8_14</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2003, p.186-199</ispartof><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,778,782,787,788,4038,4039,27912</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15759323$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>DONG KYUE KIM</creatorcontrib><creatorcontrib>JEONG SEOP SIM</creatorcontrib><creatorcontrib>PARK, Heejin</creatorcontrib><creatorcontrib>PARK, Kunsoo</creatorcontrib><title>Linear-time construction of suffix arrays: (Extended abstract)</title><title>Lecture notes in computer science</title><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540403116</isbn><isbn>9783540403111</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotjjtrwzAUhUUfUDfN3tFLoR3UXunKltShEEL6AEOXdjbXeoBLYgfJgeTf19Ce5Qzf4eMwdivgUQDoJ-SVAq6UMYabVqgzVohaCI6o7Dm7xpkqQCHqC1YAguRWK7xiy5x_YI60EgQW7KXph0CJT_0ulG4c8pQOburHoRxjmQ8x9seSUqJTfi7vN8cpDD74krp5R256uGGXkbY5LP97wb5fN1_rd958vn2sVw3fS6knXkurVO0648FoAdZpE6OXwdcS3fzTojWVw6A0IApS2lOlIzjZKU91NLhgd3_ePWVH25hocH1u96nfUTq1otKVRYn4C3XiTWk</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>DONG KYUE KIM</creator><creator>JEONG SEOP SIM</creator><creator>PARK, Heejin</creator><creator>PARK, Kunsoo</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Linear-time construction of suffix arrays: (Extended abstract)</title><author>DONG KYUE KIM ; JEONG SEOP SIM ; PARK, Heejin ; PARK, Kunsoo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p227t-629446cb8d087109c78ffd2ed623c04093985c3e470331a47da57f0c2b4da6f83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>DONG KYUE KIM</creatorcontrib><creatorcontrib>JEONG SEOP SIM</creatorcontrib><creatorcontrib>PARK, Heejin</creatorcontrib><creatorcontrib>PARK, Kunsoo</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>DONG KYUE KIM</au><au>JEONG SEOP SIM</au><au>PARK, Heejin</au><au>PARK, Kunsoo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Linear-time construction of suffix arrays: (Extended abstract)</atitle><btitle>Lecture notes in computer science</btitle><date>2003</date><risdate>2003</risdate><spage>186</spage><epage>199</epage><pages>186-199</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540403116</isbn><isbn>9783540403111</isbn><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/3-540-44888-8_14</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2003, p.186-199 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15759323 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Theoretical computing |
| title | Linear-time construction of suffix arrays: (Extended abstract) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T16%3A31%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Linear-time%20construction%20of%20suffix%20arrays:%20(Extended%20abstract)&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=DONG%20KYUE%20KIM&rft.date=2003&rft.spage=186&rft.epage=199&rft.pages=186-199&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540403116&rft.isbn_list=9783540403111&rft_id=info:doi/10.1007/3-540-44888-8_14&rft_dat=%3Cpascalfrancis%3E15759323%3C/pascalfrancis%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 |