{"id":"https://openalex.org/W1875619160","doi":"https://doi.org/10.1109/dcc.2000.838157","title":"On the performance of BWT sorting algorithms","display_name":"On the performance of BWT sorting algorithms","publication_year":2002,"publication_date":"2002-11-07","ids":{"openalex":"https://openalex.org/W1875619160","doi":"https://doi.org/10.1109/dcc.2000.838157","mag":"1875619160"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2000.838157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2000.838157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings DCC 2000. Data Compression Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109081829","display_name":"John P. Seward","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"J. Seward","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research, Cambridge, UK;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research, Cambridge, UK;","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109081829"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":10.6572,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.98422445,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9936000108718872,"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/computer-science","display_name":"Computer science","score":0.824333667755127},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7982176542282104},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7373015284538269},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6888094544410706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6303141117095947},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5097036361694336},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5047508478164673},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4665166139602661},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.46087414026260376},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4546348452568054},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4372008442878723},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4254192113876343},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1305285394191742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11737754940986633}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.824333667755127},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7982176542282104},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7373015284538269},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6888094544410706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6303141117095947},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5097036361694336},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5047508478164673},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4665166139602661},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.46087414026260376},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4546348452568054},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4372008442878723},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4254192113876343},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1305285394191742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11737754940986633},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2000.838157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2000.838157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings DCC 2000. Data Compression Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1496073286","https://openalex.org/W1601718731","https://openalex.org/W2000484009","https://openalex.org/W2119878143","https://openalex.org/W2158874082","https://openalex.org/W2161488606","https://openalex.org/W6650339521"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W2085265870","https://openalex.org/W797244100","https://openalex.org/W1999431223","https://openalex.org/W2043772124","https://openalex.org/W2801186172","https://openalex.org/W2367560286"],"abstract_inverted_index":{"In":[0],"recent":[1],"years":[2],"lossless":[3],"text":[4],"compression":[5,19],"based":[6],"on":[7,82,114],"the":[8,24,27,58,73,80,109,128],"Burrows-Wheeler":[9],"transform":[10],"(BWT)":[11],"has":[12],"grown":[13],"popular.":[14],"The":[15],"expensive":[16],"activity":[17],"during":[18],"is":[20],"sorting":[21,43,96],"of":[22,26,29,41,48,79,85,93,112,121,134],"all":[23],"rotations":[25],"block":[28],"data":[30],"to":[31],"compress.":[32],"Burrows":[33],"and":[34,76,124,139],"Wheeler":[35],"(1994)":[36],"describe":[37,66],"an":[38],"efficient":[39],"implementation":[40,92],"rotation":[42],"but":[44],"give":[45],"little":[46],"analysis":[47],"its":[49],"performance.":[50],"This":[51],"paper":[52],"addresses":[53],"that":[54],"need.":[55],"We":[56,118],"present":[57,71],"base":[59],"algorithm":[60,97],"using":[61],"a":[62,83,90,131],"more":[63],"formal":[64],"framework,":[65],"two":[67],"important":[68],"optimisations":[69],"not":[70],"in":[72],"original":[74],"paper,":[75],"measure":[77],"performance":[78,113],"variants":[81,136],"set":[84],"14":[86],"files.":[87],"For":[88],"completeness,":[89],"tuned":[91],"Sadakane's":[94],"(1998)":[95],"was":[98],"also":[99],"tested.":[100],"Merely":[101],"measuring":[102],"running":[103],"times":[104],"gives":[105],"poor":[106],"insight":[107],"into":[108],"finer":[110],"aspects":[111],"contemporary":[115],"machine":[116],"architectures.":[117],"report":[119],"measurements":[120],"instruction":[122],"counts":[123],"cache":[125],"misses":[126],"for":[127],"algorithms":[129],"giving":[130],"clearer":[132],"picture":[133],"which":[135],"perform":[137],"well,":[138],"why.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}