{"id":"https://openalex.org/W1979173710","doi":"https://doi.org/10.1145/2649387.2660796","title":"High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels","display_name":"High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels","publication_year":2014,"publication_date":"2014-09-20","ids":{"openalex":"https://openalex.org/W1979173710","doi":"https://doi.org/10.1145/2649387.2660796","mag":"1979173710"},"language":"en","primary_location":{"id":"doi:10.1145/2649387.2660796","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2649387.2660796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics","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/A5026593207","display_name":"Jesmin Jahan Tithi","orcid":"https://orcid.org/0000-0002-2861-8393"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jesmin Jahan Tithi","raw_affiliation_strings":["Stony Brook University, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002918693","display_name":"Pramod Ganapathi","orcid":"https://orcid.org/0000-0001-5090-4444"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pramod Ganapathi","raw_affiliation_strings":["Stony Brook University, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002197138","display_name":"Aakrati Talati","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aakrati Talati","raw_affiliation_strings":["Stony Brook University, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025290203","display_name":"Rezaul Chowdhury","orcid":"https://orcid.org/0000-0002-7022-5278"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rezaul Chowdhury","raw_affiliation_strings":["Stony Brook University, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"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.0621549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"600","last_page":"601"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9972000122070312,"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.9972000122070312,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.986299991607666,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9860000014305115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7807952165603638},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6156203746795654},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5918176770210266},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5571936368942261},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5421664714813232},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.45814603567123413},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.45580223202705383},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4374259114265442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3608652949333191},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3570423722267151},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1855485439300537}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7807952165603638},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6156203746795654},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5918176770210266},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5571936368942261},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5421664714813232},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45814603567123413},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.45580223202705383},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4374259114265442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3608652949333191},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3570423722267151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1855485439300537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2649387.2660796","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2649387.2660796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1968245790","https://openalex.org/W2164202285"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2908130256","https://openalex.org/W2528452804","https://openalex.org/W1500978221","https://openalex.org/W4312602923"],"abstract_inverted_index":{"Dynamic":[0],"Programming":[1],"(DP)":[2],"provides":[3],"optimal":[4,11],"solutions":[5,12],"to":[6,13,23,35,42,80,118,228],"a":[7,50,205,221],"problem":[8,27,102],"by":[9,187,214,262],"combining":[10],"many":[14,36,182],"overlapping":[15,21],"subproblems.":[16],"DP":[17,58,87,133,191,212,231,243],"algorithms":[18,134,145,157,174],"exploit":[19],"this":[20,46],"property":[22],"explore":[24],"otherwise":[25],"exponential-sized":[26],"spaces":[28],"in":[29,91,148],"polynomial":[30],"time,":[31],"making":[32],"them":[33],"central":[34],"important":[37],"applications":[38],"spanning":[39],"from":[40,77],"logistics":[41],"computational":[43],"biology.":[44],"In":[45],"paper,":[47],"we":[48],"present":[49,220,251],"general":[51],"strategy":[52],"of":[53,126,170,259],"obtaining":[54],"highly":[55,119,210],"efficient":[56,211],"parallel":[57,132],"implementations":[59,213,234],"using":[60,107],"recursive":[61,108,131,159,172],"cache-oblivious":[62,109],"divide":[63],"and":[64,78,103,141,257,267],"conquer":[65],"technique":[66,110],"which":[67],"turns":[68],"inflexible":[69,115],"kernels":[70],"into":[71],"flexible":[72,121,179],"ones":[73],"(kernels":[74],"that":[75,111,166,180,226],"read":[76],"write":[79],"disjoint":[81],"sub-matrices).":[82],"We":[83,164,219,249],"solve":[84],"four":[85],"non-trivial":[86],"problems":[88,200],"widely":[89],"used":[90],"Bioinformatics,":[92],"namely":[93],"the":[94,113,124,138,149,167,188,194],"parenthesis":[95],"problem,":[96],"Floyd-Warshall's":[97],"all-pairs":[98],"shortest":[99],"paths,":[100],"gap":[101,142],"protein":[104,139],"accordion":[105],"folding":[106,140],"decompose":[112],"original":[114],"looping":[116,190],"kernel":[117,197],"optimizable":[120],"kernels.":[122,218],"To":[123],"best":[125],"our":[127],"knowledge":[128],"no":[129],"such":[130],"were":[135],"known":[136],"for":[137,198,265],"problems.":[143],"The":[144],"are":[146,158,175,201],"hybrid":[147],"same":[150],"way":[151],"as":[152],"most":[153,195],"high-performance":[154],"matrix":[155],"multiplication":[156],"with":[160],"iterative":[161],"base":[162,168],"cases.":[163],"show":[165],"cases":[169],"these":[171,199,217,230],"divide-and-conquer":[173],"predominantly":[176],"matrix-multiplication-like":[177],"(MM-like)":[178],"expose":[181],"optimization":[183,224],"opportunities":[184],"not":[185],"offered":[186],"traditional":[189],"codes.":[192],"Moreover,":[193],"costly/dominating":[196],"often":[202],"flexible.":[203],"As":[204],"result,":[206],"one":[207],"can":[208],"obtain":[209],"simply":[215],"optimizing":[216],"few":[222],"generic":[223],"steps":[225],"suffices":[227],"optimize":[229],"implementations.":[232],"Our":[233],"achieve":[235],"5--100x":[236],"speedup":[237],"over":[238],"their":[239],"standard":[240],"loop":[241],"based":[242],"counterparts":[244],"on":[245,253],"modern":[246],"multicore":[247],"machines.":[248],"also":[250],"results":[252],"manycores":[254],"(Xeon":[255],"Phi)":[256],"clusters":[258],"multicores":[260],"obtained":[261],"simple":[263],"extensions":[264],"SIMD":[266],"shared-distributed-shared-memory":[268],"architectures,":[269],"respectively.":[270]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}