{"id":"https://openalex.org/W149323099","doi":null,"title":"Computing Maximum Subsequence in Parallel.","display_name":"Computing Maximum Subsequence in Parallel.","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W149323099","mag":"149323099"},"language":"en","primary_location":{"id":"mag:149323099","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wob/wob2003.html#AlvesCS03","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W149323099"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5013849641","display_name":"C. E. R. Alves","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"C. E. R. Alves","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028026699","display_name":"Edson N. C\u00e1ceres","orcid":"https://orcid.org/0000-0001-6471-3462","observed_orcids":["https://orcid.org/0000-0001-6471-3462"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Edson N. C\u00e1ceres","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113757410","display_name":"Siang Wun Song","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Siang Wun Song","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2164,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37649718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"87"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9887999892234802,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9887999892234802,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.0026000000070780516,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/parallel-algorithms","display_name":"parallel algorithms","score":0.8560000061988831},{"id":"https://openalex.org/keywords/data-reduction","display_name":"data reduction","score":0.5929999947547913},{"id":"https://openalex.org/keywords/dna-sequence-analysis","display_name":"DNA sequence analysis","score":0.6779999732971191},{"id":"https://openalex.org/keywords/protein-sequence-analysis","display_name":"protein sequence analysis","score":0.9599999785423279},{"id":"https://openalex.org/keywords/linear-speedup","display_name":"linear speedup","score":0.7549999952316284},{"id":"https://openalex.org/keywords/beowulf-cluster","display_name":"Beowulf cluster","score":0.7950000166893005}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6287923455238342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5565525889396667},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4310765862464905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3182953894138336},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"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":2,"locations":[{"id":"mag:149323099","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wob/wob2003.html#AlvesCS03","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.533.9365","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.9365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ime.usp.br/~song/mac5705/wob03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1509502258","https://openalex.org/W1970998199","https://openalex.org/W1977338887","https://openalex.org/W2021790140","https://openalex.org/W2045271686","https://openalex.org/W2055050002","https://openalex.org/W2336485197"],"related_works":["https://openalex.org/W1492464344","https://openalex.org/W7099724974","https://openalex.org/W2541327307","https://openalex.org/W1685884264","https://openalex.org/W2097276082","https://openalex.org/W1533815075","https://openalex.org/W2807084002","https://openalex.org/W6995506735","https://openalex.org/W1568003732","https://openalex.org/W2900902043"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,38,126,147],"maximum":[2,39],"subsequence":[3,8,40],"problem":[4,21,41],"nds":[5],"the":[6,14,31,72,75,81,84,104,119,124,136,143,151],"contiguous":[7],"of":[9,33,42,68,118,128,138,142,150],"n":[10,43],"real":[11],"numbers":[12],"with":[13],"highest":[15],"sum.":[16],"This":[17,96],"is":[18,77,90,98,131,135,154],"an":[19,58,116],"impor-tant":[20],"that":[22,63],"arises":[23],"in":[24,27,30,50],"several":[25],"contexts":[26],"Computational":[28],"Biology":[29],"analysis":[32],"DNA":[34],"or":[35],"protein":[36],"sequences.":[37],"given":[44],"scores":[45],"can":[46],"be":[47,108],"solved":[48],"sequentially":[49],"O(n)":[51],"time.":[52],"In":[53,71],"this":[54],"paper":[55],"we":[56],"present":[57],"ecient":[59],"BSP/CGM":[60],"parallel":[61,152,164],"algorithm":[62,121,153],"requires":[64],"a":[65,111,161],"constant":[66],"number":[67,137],"communication":[69],"rounds.":[70],"proposed":[73],"algorithm,":[74],"input":[76,144],"partitioned":[78],"equally":[79],"among":[80],"processors":[82],"and":[83],"sequence":[85],"stored":[86],"on":[87,110,160],"each":[88],"processor":[89,113],"reduced":[91],"to":[92,107,122],"only":[93],"ve":[94],"numbers.":[95],"reduction":[97],"crucial":[99],"as":[100],"it":[101],"allows":[102],"all":[103],"resulting":[105],"values":[106],"concentrated":[109],"single":[112],"which":[114],"runs":[115],"adaptation":[117],"sequential":[120],"obtain":[123],"result.":[125],"amount":[127],"data":[129],"transmitted":[130],"5p":[132],"where":[133],"p":[134],"processors,":[139],"thus":[140],"independent":[141],"size":[145],"n.":[146],"good":[148],"performance":[149],"conrmed":[155],"by":[156],"experimental":[157],"re-sults":[158],"run":[159],"64-node":[162],"Beowulf":[163],"computer,":[165],"giving":[166],"almost":[167],"linear":[168],"speedup.":[169]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W149323099","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
