Parallel construction of a suffix tree with applications

Saved in:
Bibliographic Details
Published in:Algorithmica 1988-11, Vol.3 (1-4), p.347-365
Main Authors: Apostolico, A., Iliopoulos, C., Landau, G. M., Schieber, B., Vishkin, U.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233
cites cdi_FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233
container_end_page 365
container_issue 1-4
container_start_page 347
container_title Algorithmica
container_volume 3
creator Apostolico, A.
Iliopoulos, C.
Landau, G. M.
Schieber, B.
Vishkin, U.
description
doi_str_mv 10.1007/BF01762122
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF01762122</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF01762122</sourcerecordid><originalsourceid>FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233</originalsourceid><addsrcrecordid>eNpFj0FLw0AQhRdRMFYv_oI9C9GZ2U12e9Riq1DQg57DZLqLkdiE3RT139uiIO_w4PHx4FPqEuEaAdzN3RLQ1YRER6pAa6iEyuKxKvazL22N7lSd5fwOgOTmdaH8Myfu-9BrGbZ5SjuZumGrh6hZ512M3ZeeUgj6s5veNI9j3wkfiHyuTiL3OVz89Uy9Lu9fFg_l-mn1uLhdl2JMNZXGiWsj2lBHt08tXtoIODcGwbOrWMjTRpxtKQhZsOwdiWPeQGiFjJmpq99fSUPOKcRmTN0Hp-8GoTk4N__O5gc_VUk9</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Parallel construction of a suffix tree with applications</title><source>SpringerLink_过刊（NSTL购买）</source><creator>Apostolico, A. ; Iliopoulos, C. ; Landau, G. M. ; Schieber, B. ; Vishkin, U.</creator><creatorcontrib>Apostolico, A. ; Iliopoulos, C. ; Landau, G. M. ; Schieber, B. ; Vishkin, U.</creatorcontrib><identifier>ISSN: 0178-4617</identifier><identifier>EISSN: 1432-0541</identifier><identifier>DOI: 10.1007/BF01762122</identifier><language>eng</language><ispartof>Algorithmica, 1988-11, Vol.3 (1-4), p.347-365</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233</citedby><cites>FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Apostolico, A.</creatorcontrib><creatorcontrib>Iliopoulos, C.</creatorcontrib><creatorcontrib>Landau, G. M.</creatorcontrib><creatorcontrib>Schieber, B.</creatorcontrib><creatorcontrib>Vishkin, U.</creatorcontrib><title>Parallel construction of a suffix tree with applications</title><title>Algorithmica</title><issn>0178-4617</issn><issn>1432-0541</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1988</creationdate><recordtype>article</recordtype><recordid>eNpFj0FLw0AQhRdRMFYv_oI9C9GZ2U12e9Riq1DQg57DZLqLkdiE3RT139uiIO_w4PHx4FPqEuEaAdzN3RLQ1YRER6pAa6iEyuKxKvazL22N7lSd5fwOgOTmdaH8Myfu-9BrGbZ5SjuZumGrh6hZ512M3ZeeUgj6s5veNI9j3wkfiHyuTiL3OVz89Uy9Lu9fFg_l-mn1uLhdl2JMNZXGiWsj2lBHt08tXtoIODcGwbOrWMjTRpxtKQhZsOwdiWPeQGiFjJmpq99fSUPOKcRmTN0Hp-8GoTk4N__O5gc_VUk9</recordid><startdate>198811</startdate><enddate>198811</enddate><creator>Apostolico, A.</creator><creator>Iliopoulos, C.</creator><creator>Landau, G. M.</creator><creator>Schieber, B.</creator><creator>Vishkin, U.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>198811</creationdate><title>Parallel construction of a suffix tree with applications</title><author>Apostolico, A. ; Iliopoulos, C. ; Landau, G. M. ; Schieber, B. ; Vishkin, U.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1988</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Apostolico, A.</creatorcontrib><creatorcontrib>Iliopoulos, C.</creatorcontrib><creatorcontrib>Landau, G. M.</creatorcontrib><creatorcontrib>Schieber, B.</creatorcontrib><creatorcontrib>Vishkin, U.</creatorcontrib><collection>CrossRef</collection><jtitle>Algorithmica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Apostolico, A.</au><au>Iliopoulos, C.</au><au>Landau, G. M.</au><au>Schieber, B.</au><au>Vishkin, U.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parallel construction of a suffix tree with applications</atitle><jtitle>Algorithmica</jtitle><date>1988-11</date><risdate>1988</risdate><volume>3</volume><issue>1-4</issue><spage>347</spage><epage>365</epage><pages>347-365</pages><issn>0178-4617</issn><eissn>1432-0541</eissn><doi>10.1007/BF01762122</doi><tpages>19</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0178-4617
ispartof Algorithmica, 1988-11, Vol.3 (1-4), p.347-365
issn 0178-4617
1432-0541
language eng
recordid cdi_crossref_primary_10_1007_BF01762122
source SpringerLink_过刊（NSTL购买）
title Parallel construction of a suffix tree with applications
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T11%3A28%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Parallel%20construction%20of%20a%20suffix%20tree%20with%20applications&rft.jtitle=Algorithmica&rft.au=Apostolico,%20A.&rft.date=1988-11&rft.volume=3&rft.issue=1-4&rft.spage=347&rft.epage=365&rft.pages=347-365&rft.issn=0178-4617&rft.eissn=1432-0541&rft_id=info:doi/10.1007/BF01762122&rft_dat=%3Ccrossref%3E10_1007_BF01762122%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c335t-37c7bf14e6f7f7f6c8cbf01933108a75ac282dc74b2ec2404a872c7aad0ebc233%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true