{"id":"https://openalex.org/W4407742072","doi":"https://doi.org/10.3233/978-1-60750-530-3-150","title":"A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies","display_name":"A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W4407742072","doi":"https://doi.org/10.3233/978-1-60750-530-3-150"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-60750-530-3-150","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-530-3-150","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},"type":"book-chapter","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":null,"display_name":"Iliopoulos Costas S.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Iliopoulos Costas S.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019033924","display_name":"Marie Laurent","orcid":"https://orcid.org/0000-0002-6484-1277"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mouchard Laurent","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5116328874","display_name":"Pissis Solon P.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pissis Solon P.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.44199403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9891999959945679,"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.9891999959945679,"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.9878000020980835,"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/throughput","display_name":"Throughput","score":0.7377465963363647},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.6985951662063599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6533010005950928},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5846792459487915},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5137065649032593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.482170045375824},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.4201018512248993},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4072558283805847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3321811556816101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2412112057209015},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.22612759470939636},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12067234516143799},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08514159917831421},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.039421021938323975}],"concepts":[{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.7377465963363647},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.6985951662063599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6533010005950928},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5846792459487915},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5137065649032593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.482170045375824},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.4201018512248993},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4072558283805847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3321811556816101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2412112057209015},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.22612759470939636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12067234516143799},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08514159917831421},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.039421021938323975},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/978-1-60750-530-3-150","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-530-3-150","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/42661f7a-d3c8-415e-8e20-94e4c9317188","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/42661f7a-d3c8-415e-8e20-94e4c9317188","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Iliopoulos, C S, Mouchard, L & Pissis, S P 2010, A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. in Proceedings of the International Conference on Parallel Computing (PARCO 2009). vol. 19, pp. 150-157. https://doi.org/10.3233/978-1-60750-530-3-150","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2054173104","https://openalex.org/W2257399947","https://openalex.org/W2051764263","https://openalex.org/W2935705348","https://openalex.org/W2358632292","https://openalex.org/W2502807948","https://openalex.org/W2069035364","https://openalex.org/W52396946","https://openalex.org/W2111239386","https://openalex.org/W4200287105"],"abstract_inverted_index":{"The":[0],"approximate":[1,40,65],"string":[2,41,66],"matching":[3,42,67],"problem":[4],"is":[5,111,150],"to":[6,46],"find":[7],"all":[8,85],"locations":[9],"at":[10],"which":[11],"a":[12,18,21,58,70,73,93,99,134],"query":[13],"of":[14,20,23,33,60,84,87,89,95,103,115,128,132,137,152],"length":[15,24,90],"m":[16],"matches":[17],"substring":[19,94],"text":[22,71],"n":[25],"with":[26,30],"k-or-fewer":[27],"differences.":[28],"Nowadays,":[29],"the":[31,39,63,81,112,116,126,138,144,147,155],"advent":[32],"novel":[34],"high":[35],"throughput":[36],"sequencing":[37],"technologies,":[38],"algorithms":[43],"are":[44],"used":[45],"identify":[47],"similarities,":[48],"molecular":[49],"functions":[50],"and":[51,76,92,124,154],"abnormalities":[52],"in":[53,122],"DNA":[54],"sequences.":[55],"We":[56,97],"consider":[57],"generalization":[59],"this":[61],"problem,":[62],"fixed-length":[64],"problem:":[68],"given":[69],"t,":[72],"pattern":[74],"ρ":[75,88],"an":[77],"integer":[78],"ℓ,":[79],"compute":[80],"optimal":[82],"alignment":[83],"substrings":[86],"ℓ":[91],"t.":[96],"present":[98],"practical":[100],"parallel":[101],"algorithm":[102],"comparable":[104],"simplicity":[105],"that":[106],"requires":[107],"onlytime,":[108],"where":[109],"w":[110],"word":[113],"size":[114,157],"machine":[117],"(e.g.":[118],"32":[119],"or":[120],"64":[121],"practice)":[123],"p":[125],"number":[127],"processors,":[129],"by":[130],"virtue":[131],"computing":[133],"bit":[135],"representation":[136],"relocatable":[139],"dynamic":[140],"programming":[141],"matrix":[142],"for":[143],"problem.":[145],"Thus":[146],"algorithm's":[148],"performance":[149],"independent":[151],"k":[153],"alphabet":[156],"|Σ|.":[158]},"counts_by_year":[],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}