{"id":"https://openalex.org/W2002121497","doi":"https://doi.org/10.1142/s0129054103001613","title":"ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES","display_name":"ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2002121497","doi":"https://doi.org/10.1142/s0129054103001613","mag":"2002121497"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103001613","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001613","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5100600528","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-3472-1717"},"institutions":[{"id":"https://openalex.org/I63772739","display_name":"Florida Atlantic University","ror":"https://ror.org/05p8w6387","country_code":"US","type":"education","lineage":["https://openalex.org/I63772739"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JIE WU","raw_affiliation_strings":["Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA","institution_ids":["https://openalex.org/I63772739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113445741","display_name":"Stephen Olariu","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"STEPHEN OLARIU","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529, USA","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10625148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"01","first_page":"99","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"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.9983999729156494,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9891999959945679,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.8731346130371094},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6695486307144165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5277705192565918},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5221000909805298},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.47983190417289734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4679160416126251},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4115142822265625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35802048444747925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3246287703514099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31523674726486206},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28788864612579346}],"concepts":[{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.8731346130371094},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6695486307144165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5277705192565918},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5221000909805298},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.47983190417289734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4679160416126251},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4115142822265625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35802048444747925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3246287703514099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31523674726486206},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28788864612579346},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.0},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054103001613","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001613","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1978583881","https://openalex.org/W2003662071","https://openalex.org/W2024385930","https://openalex.org/W2033472258","https://openalex.org/W4210766026"],"related_works":["https://openalex.org/W1997715509","https://openalex.org/W2356015003","https://openalex.org/W2074050947","https://openalex.org/W1838431648","https://openalex.org/W2156833550","https://openalex.org/W2006931095","https://openalex.org/W2060029658","https://openalex.org/W4237134732","https://openalex.org/W1594272482","https://openalex.org/W2165167056"],"abstract_inverted_index":{"The":[0,51],"problem":[1],"of":[2,40],"merging":[3,25],"two":[4],"intransitive":[5],"sorted":[6,13],"sequences":[7],"(that":[8],"is,":[9],"to":[10],"generate":[11],"a":[12,37],"total":[14],"order":[15],"without":[16],"the":[17,30,55],"transitive":[18],"property)":[19],"is":[20,27,58],"considered.":[21],"A":[22],"cost-optimal":[23,52],"parallel":[24],"algorithm":[26,35],"proposed":[28],"under":[29],"EREW":[31],"PRAM":[32],"model.":[33],"This":[34],"has":[36],"run":[38],"time":[39],"O(":[41],"log":[42,47],"2":[43,48],"n)":[44,49],"using":[45],"O(n/":[46],"processors.":[50],"merge":[53],"in":[54],"strong":[56],"sense":[57],"still":[59],"an":[60],"open":[61],"problem.":[62]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}