{"id":"https://openalex.org/W1993399552","doi":"https://doi.org/10.1145/2807591.2807609","title":"Parallel distributed memory construction of suffix and longest common prefix arrays","display_name":"Parallel distributed memory construction of suffix and longest common prefix arrays","publication_year":2015,"publication_date":"2015-10-27","ids":{"openalex":"https://openalex.org/W1993399552","doi":"https://doi.org/10.1145/2807591.2807609","mag":"1993399552"},"language":"en","primary_location":{"id":"doi:10.1145/2807591.2807609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2807591.2807609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2807609&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2807609&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023547296","display_name":"Patrick Flick","orcid":"https://orcid.org/0000-0003-3343-2398"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Patrick Flick","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, Georgia","Georgia Institute of Technology , Atlanta, Georgia"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology , Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074347913","display_name":"Srinivas Aluru","orcid":"https://orcid.org/0000-0003-4279-469X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivas Aluru","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, Georgia","Georgia Institute of Technology , Atlanta, Georgia"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology , Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023547296"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":6.2313,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.96403806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.965399980545044,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.8234161734580994},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.8076760768890381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7848294973373413},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7634330987930298},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.7348281145095825},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6878630518913269},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.6301898956298828},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5750236511230469},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5639371275901794},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5203235149383545},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4877098500728607},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43262606859207153},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43015414476394653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39361217617988586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34573817253112793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16732066869735718},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07625791430473328}],"concepts":[{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.8234161734580994},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8076760768890381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7848294973373413},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7634330987930298},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.7348281145095825},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6878630518913269},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.6301898956298828},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5750236511230469},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5639371275901794},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5203235149383545},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4877098500728607},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43262606859207153},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43015414476394653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39361217617988586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34573817253112793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16732066869735718},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07625791430473328},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2807591.2807609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2807591.2807609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2807609&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2807591.2807609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2807591.2807609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2807609&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1683691965","display_name":null,"funder_award_id":"1229081","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1795292305","display_name":null,"funder_award_id":"CNS-1229081","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2567864256","display_name":null,"funder_award_id":"CCF-1360593","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2766341901","display_name":"BIGDATA: Mid-Scale: DA: Collaborative Research: Genomes Galore - Core Techniques, Libraries, and Domain Specific Languages for High-Throughput DNA Sequencing","funder_award_id":"1416259","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4078666295","display_name":"AF: Medium: Parallel Algorithms and Software for High-Throughput Sequence Assembly","funder_award_id":"1360593","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7469405548","display_name":null,"funder_award_id":"IIS-1416259","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7897703779","display_name":null,"funder_award_id":"CCF-1360593, IIS-1416259","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1993399552.pdf","grobid_xml":"https://content.openalex.org/works/W1993399552.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W12026041","https://openalex.org/W57812598","https://openalex.org/W117230746","https://openalex.org/W1489909987","https://openalex.org/W1506856932","https://openalex.org/W1966318226","https://openalex.org/W1966473320","https://openalex.org/W1976044495","https://openalex.org/W1976682045","https://openalex.org/W1989741444","https://openalex.org/W2000484009","https://openalex.org/W2006550632","https://openalex.org/W2030178036","https://openalex.org/W2032574053","https://openalex.org/W2044127221","https://openalex.org/W2044824397","https://openalex.org/W2059513841","https://openalex.org/W2072731885","https://openalex.org/W2089545095","https://openalex.org/W2090875625","https://openalex.org/W2096791516","https://openalex.org/W2109062349","https://openalex.org/W2111217142","https://openalex.org/W2119404103","https://openalex.org/W2130564474","https://openalex.org/W2134283755","https://openalex.org/W2141238531","https://openalex.org/W2158874082","https://openalex.org/W2159136754","https://openalex.org/W2160962794","https://openalex.org/W2434820933","https://openalex.org/W2539361505","https://openalex.org/W3034815474"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W2405892617","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W4293529780","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W2073921136","https://openalex.org/W1965532872","https://openalex.org/W3092594492"],"abstract_inverted_index":{"Suffix":[0],"arrays":[1,68,74,125],"and":[2,38,69,82,123],"trees":[3],"are":[4],"fundamental":[5],"string":[6],"data":[7],"structures":[8],"of":[9,44,66,103,121,126,142],"importance":[10],"to":[11,146],"many":[12],"applications":[13],"in":[14,89,115,130],"computational":[15],"biology.":[16],"Consequently,":[17],"their":[18],"parallel":[19,60,104],"construction":[20,65,120,152],"is":[21,100],"an":[22],"actively":[23],"studied":[24],"problem.":[25],"To":[26],"date,":[27],"algorithms":[28,61,87],"with":[29],"best":[30,148],"practical":[31,84],"performance":[32,114],"lack":[33],"efficient":[34],"worst-case":[35,79,95],"run-time":[36,80,102],"guarantees,":[37],"vice":[39],"versa.":[40],"In":[41,55],"addition,":[42],"much":[43],"the":[45,101,119,127,147],"recent":[46],"work":[47],"targeted":[48],"low":[49],"core":[50],"count,":[51],"shared":[52],"memory":[53,64],"parallelization.":[54],"this":[56],"paper,":[57],"we":[58],"present":[59,107],"for":[62],"distributed":[63],"suffix":[67,122,150],"longest":[70],"common":[71],"prefix":[72],"(LCP)":[73],"that":[75,112],"simultaneously":[76],"achieve":[77],"good":[78],"bounds":[81],"superior":[83],"performance.":[85],"Our":[86],"run":[88],"O(Tsort(n,":[90],"p)":[91,99],"\u00b7":[92],"log":[93],"n)":[94],"time":[96],"where":[97],"Tsort(n,":[98],"sorting.":[105],"We":[106,117],"several":[108],"algorithm":[109],"engineering":[110],"techniques":[111],"improve":[113],"practice.":[116],"demonstrate":[118],"LCP":[124],"human":[128],"genome":[129],"less":[131],"than":[132],"8":[133],"seconds":[134],"on":[135],"1,024":[136],"Intel":[137],"Xeon":[138],"cores,":[139],"reaching":[140],"speedups":[141],"over":[143],"110X":[144],"compared":[145],"sequential":[149],"array":[151],"implementation":[153],"divsufsort.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}