{"id":"https://openalex.org/W2519106983","doi":"https://doi.org/10.1109/hpcsim.2016.7568439","title":"Two parallel alignment algorithms for big number of strings","display_name":"Two parallel alignment algorithms for big number of strings","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2519106983","doi":"https://doi.org/10.1109/hpcsim.2016.7568439","mag":"2519106983"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2016.7568439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","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/A5065606103","display_name":"Christine Gfrerer","orcid":null},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Christine Gfrerer","raw_affiliation_strings":["Department of Computer Sciences, University of Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022662194","display_name":"Mari\u00e1n Vajter\u0161ic","orcid":null},"institutions":[{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"funder","lineage":["https://openalex.org/I207624831"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Marian Vajtersic","raw_affiliation_strings":["Department of Informatics Slovak Academy of Sciences, Bratislava"],"affiliations":[{"raw_affiliation_string":"Department of Informatics Slovak Academy of Sciences, Bratislava","institution_ids":["https://openalex.org/I207624831"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027207015","display_name":"Rade Kutil","orcid":"https://orcid.org/0000-0003-4805-1096"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Rade Kutil","raw_affiliation_strings":["Department of Computer Sciences, University of Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065606103"],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1191791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"967","last_page":"972"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12016","display_name":"Web Data Mining and Analysis","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9941999912261963,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9696999788284302,"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.7991863489151001},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5967726111412048},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5615764260292053},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5440338253974915},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5223066210746765},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5027480125427246},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4627423882484436},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.45645400881767273},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.4392154812812805},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43784838914871216},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.428364634513855},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.4145185351371765},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.411819189786911},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4036538600921631},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35757631063461304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1458817720413208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1009797751903534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7991863489151001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5967726111412048},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5615764260292053},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5440338253974915},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5223066210746765},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5027480125427246},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4627423882484436},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.45645400881767273},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.4392154812812805},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43784838914871216},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.428364634513855},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.4145185351371765},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.411819189786911},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4036538600921631},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35757631063461304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1458817720413208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1009797751903534},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2016.7568439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1551326255","https://openalex.org/W2002638840","https://openalex.org/W2005646337","https://openalex.org/W2035302703","https://openalex.org/W2040757233","https://openalex.org/W2059498931","https://openalex.org/W2069388662","https://openalex.org/W2071628657","https://openalex.org/W2084297478","https://openalex.org/W2104086170","https://openalex.org/W2119577990","https://openalex.org/W2128341918","https://openalex.org/W2133669904","https://openalex.org/W2134150392","https://openalex.org/W2150721933","https://openalex.org/W2154444297","https://openalex.org/W2160189941","https://openalex.org/W2160196229","https://openalex.org/W2168358004","https://openalex.org/W2171364811","https://openalex.org/W4233962457","https://openalex.org/W4255011371","https://openalex.org/W6675573929"],"related_works":["https://openalex.org/W1586380695","https://openalex.org/W2021626172","https://openalex.org/W1578329712","https://openalex.org/W1981558729","https://openalex.org/W2357113990","https://openalex.org/W2266782682","https://openalex.org/W2120490947","https://openalex.org/W206295951","https://openalex.org/W3082558912","https://openalex.org/W1551221054"],"abstract_inverted_index":{"This":[0],"poster":[1],"paper":[2],"deals":[3],"with":[4,135,154,174,188],"algorithmic":[5],"solutions":[6],"for":[7,57,90,157],"the":[8,27,40,46,59,63,85,105,109,112,122,172,189,200],"alignment":[9,60],"of":[10,14,29,42,48,65,67,87,100,104,160,168,182,202],"a":[11,19,151,158],"large":[12],"number":[13],"data":[15,68,101,114,162,190,204],"strings,":[16],"which":[17,77],"is":[18,178,205],"challenging":[20],"and":[21,37,45,133,139,144,207],"computationally":[22],"demanding":[23],"task,":[24],"belonging":[25],"to":[26,34,102,119,193],"class":[28],"NP-hard":[30],"problems.":[31],"In":[32,108],"order":[33],"get":[35],"practical":[36],"time-acceptable":[38],"solutions,":[39],"development":[41],"heuristic":[43,81],"approaches":[44],"employment":[47],"parallelism":[49],"are":[50,55,95,116,129,142,148],"inevitable.":[51],"Two":[52],"parallel":[53,106,152],"algorithms":[54,72,94,128],"presented":[56],"solving":[58],"problem":[61],"in":[62,121,131],"context":[64],"extraction":[66],"from":[69,164],"webpages.":[70],"Both":[71],"have":[73],"their":[74],"sequential":[75],"counterpart,":[76],"represents":[78],"an":[79],"efficient":[80,180],"approach,":[82],"based":[83],"on":[84,150],"estimation":[86],"local":[88],"parameters":[89],"symbol":[91],"distances.":[92],"The":[93,127,166,186],"characterized":[96],"by":[97,125,176],"different":[98],"assignments":[99],"processors":[103],"system:":[107],"first":[110],"one":[111,124],"processed":[113],"sets":[115],"distributed":[117],"according":[118,192],"symbols,":[120],"second":[123],"columns.":[126],"formulated":[130],"pseudocode":[132],"implemented":[134],"MPI.":[136],"Their":[137],"computational":[138],"space":[140],"complexities":[141],"estimated":[143],"compared.":[145],"Moreover,":[146],"they":[147],"examined":[149],"cluster":[153],"multi-core":[155],"nodes":[156],"pool":[159],"test":[161],"coming":[163],"web-pages.":[165],"results":[167],"experiments":[169],"show":[170],"that":[171],"variant":[173],"distribution":[175,191],"columns":[177],"less":[179],"because":[181],"high":[183],"communication":[184],"costs.":[185],"algorithm":[187],"symbols":[194],"delivers":[195],"acceptable":[196],"timings,":[197],"especially":[198],"when":[199],"matrix":[201],"string":[203],"long":[206],"thin.":[208]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}