{"id":"https://openalex.org/W2104631000","doi":"https://doi.org/10.1109/bigdata.2013.6691757","title":"Parallel and memory-efficient Burrows-Wheeler transform","display_name":"Parallel and memory-efficient Burrows-Wheeler transform","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2104631000","doi":"https://doi.org/10.1109/bigdata.2013.6691757","mag":"2104631000"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2013.6691757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2013.6691757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Big Data","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/A5022399570","display_name":"Shinya Hayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shinya Hayashi","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan","Grad School of Information Sci. and Tech., Univ of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"Grad School of Information Sci. and Tech., Univ of Tokyo, Tokyo, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009359355","display_name":"Kenjiro Taura","orcid":"https://orcid.org/0000-0001-5224-382X"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenjiro Taura","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan","Grad School of Information Sci. and Tech., Univ of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"Grad School of Information Sci. and Tech., Univ of Tokyo, Tokyo, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022399570"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.9618,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82731157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"50"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.984000027179718,"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/T11247","display_name":"Plant nutrient uptake and metabolism","score":0.9581000208854675,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7557076215744019},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.6414815783500671},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5658109784126282},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5485154986381531},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.5480858683586121},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5173556208610535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5159957408905029},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4416212737560272},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42990541458129883},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42790210247039795},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4218660295009613},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4201755225658417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39702484011650085},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.21907633543014526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17988651990890503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09713250398635864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7557076215744019},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6414815783500671},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5658109784126282},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5485154986381531},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.5480858683586121},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5173556208610535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5159957408905029},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4416212737560272},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42990541458129883},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42790210247039795},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4218660295009613},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4201755225658417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39702484011650085},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.21907633543014526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17988651990890503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09713250398635864},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2013.6691757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2013.6691757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Big Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1860929530","https://openalex.org/W1944059350","https://openalex.org/W1980398471","https://openalex.org/W2000484009","https://openalex.org/W2011699809","https://openalex.org/W2016559894","https://openalex.org/W2017808314","https://openalex.org/W2032401773","https://openalex.org/W2032574053","https://openalex.org/W2063431258","https://openalex.org/W2067974452","https://openalex.org/W2073313438","https://openalex.org/W2088386938","https://openalex.org/W2137346250","https://openalex.org/W2139749722","https://openalex.org/W2146700739","https://openalex.org/W2158322625","https://openalex.org/W2158874082","https://openalex.org/W2161488606","https://openalex.org/W2962856362","https://openalex.org/W4206797055","https://openalex.org/W6650339521","https://openalex.org/W6683504902"],"related_works":["https://openalex.org/W2576782855","https://openalex.org/W2359436045","https://openalex.org/W153119118","https://openalex.org/W2143531254","https://openalex.org/W2608759984","https://openalex.org/W363060408","https://openalex.org/W2003608043","https://openalex.org/W2055795184","https://openalex.org/W2123393931","https://openalex.org/W2295072202"],"abstract_inverted_index":{"In":[0,138],"large":[1],"scale":[2],"applications":[3],"of":[4,24,93,96],"genome":[5,168],"analysis,":[6],"compressed":[7,29],"indexes":[8],"are":[9],"very":[10,34],"useful":[11],"to":[12,62,84],"avoid":[13],"the":[14,25,47,52,86,94,116,173,180],"memory":[15,35,43],"usage":[16],"imposed":[17],"by":[18],"suffix":[19,67,136],"arrays.":[20,137],"FM-Index":[21],"is":[22,33,57,70,105,120,147,179],"one":[23,92],"most":[26],"important":[27],"such":[28,143],"indexes.":[30],"While":[31],"it":[32,104],"efficient,":[36],"its":[37,60],"construction":[38,45],"requires":[39,65],"much":[40],"larger":[41,71],"working":[42],"during":[44],"than":[46,72,135],"final":[48],"index":[49],"itself.":[50],"Specifically,":[51],"Burrows-Wheeler":[53,87],"transform":[54],"(BWT),":[55],"which":[56,69,97,153,178],"computed":[58],"on":[59,149,166],"way":[61],"constructing":[63],"FM-Index,":[64],"a":[66,89,99,112,121,126,131,150],"array,":[68],"BWT":[73],"and":[74,170],"FM-Index.":[75],"To":[76],"address":[77],"this,":[78],"there":[79],"have":[80],"been":[81],"many":[82],"efforts":[83],"compute":[85],"in":[88],"smaller":[90,134],"space,":[91],"fastest":[95,182],"achieves":[98,111,125],"linear":[100],"time":[101,114],"complexity.":[102],"Since":[103],"unlikely":[106],"that":[107,124],"any":[108],"sequential":[109],"algorithm":[110,123,165],"sublinear":[113,127],"complexity,":[115],"next":[117],"logical":[118],"step":[119],"parallel":[122,160],"critical":[128],"path":[129],"with":[130,158,176],"space":[132],"requirement":[133],"this":[139],"paper,":[140],"we":[141],"propose":[142],"an":[144],"algorithm.":[145,183],"It":[146],"based":[148],"divide-and-conquer":[151],"algorithm,":[152],"can":[154],"be":[155],"efficiently":[156],"executed":[157],"task":[159],"models.":[161],"We":[162],"evaluated":[163],"our":[164],"human":[167],"data":[169],"obtained":[171],"almost":[172],"same":[174],"speed":[175],"BWT-IS,":[177],"known":[181]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}