{"id":"https://openalex.org/W4392255531","doi":"https://doi.org/10.1145/3637732.3637779","title":"Parallel Polynomial-Time Approximation Scheme (PTAS) for Finding Compact Structural Motifs","display_name":"Parallel Polynomial-Time Approximation Scheme (PTAS) for Finding Compact Structural Motifs","publication_year":2023,"publication_date":"2023-11-09","ids":{"openalex":"https://openalex.org/W4392255531","doi":"https://doi.org/10.1145/3637732.3637779"},"language":"en","primary_location":{"id":"doi:10.1145/3637732.3637779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3637732.3637779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 10th International Conference on Biomedical and Bioinformatics Engineering","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/A5094025371","display_name":"Bernard Brocka","orcid":"https://orcid.org/0009-0004-9143-8557"},"institutions":[{"id":"https://openalex.org/I87074743","display_name":"University of the Philippines Diliman","ror":"https://ror.org/03tbh6y23","country_code":"PH","type":"education","lineage":["https://openalex.org/I103911934","https://openalex.org/I87074743"]}],"countries":["PH"],"is_corresponding":true,"raw_author_name":"Bernard Brocka","raw_affiliation_strings":["Department of Computer Science, University of the Philippines Diliman, Philippines"],"raw_orcid":"https://orcid.org/0009-0004-9143-8557","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of the Philippines Diliman, Philippines","institution_ids":["https://openalex.org/I87074743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5094025372","display_name":"Sharlene Yap","orcid":"https://orcid.org/0009-0009-6613-4099"},"institutions":[{"id":"https://openalex.org/I87074743","display_name":"University of the Philippines Diliman","ror":"https://ror.org/03tbh6y23","country_code":"PH","type":"education","lineage":["https://openalex.org/I103911934","https://openalex.org/I87074743"]}],"countries":["PH"],"is_corresponding":false,"raw_author_name":"Sharlene Yap","raw_affiliation_strings":["Department of Computer Science, University of the Philippines Diliman, Philippines"],"raw_orcid":"https://orcid.org/0009-0009-6613-4099","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of the Philippines Diliman, Philippines","institution_ids":["https://openalex.org/I87074743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003475663","display_name":"Jhoirene Clemente","orcid":"https://orcid.org/0000-0001-8400-0785"},"institutions":[{"id":"https://openalex.org/I87074743","display_name":"University of the Philippines Diliman","ror":"https://ror.org/03tbh6y23","country_code":"PH","type":"education","lineage":["https://openalex.org/I103911934","https://openalex.org/I87074743"]}],"countries":["PH"],"is_corresponding":false,"raw_author_name":"Jhoirene Clemente","raw_affiliation_strings":["Department of Computer Science, University of the Philippines Diliman, Philippines"],"raw_orcid":"https://orcid.org/0000-0001-8400-0785","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of the Philippines Diliman, Philippines","institution_ids":["https://openalex.org/I87074743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5094025371"],"corresponding_institution_ids":["https://openalex.org/I87074743"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3390095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9972000122070312,"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/time-complexity","display_name":"Time complexity","score":0.7056103348731995},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7045789361000061},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6807417869567871},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.604432225227356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5468397736549377},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5096418857574463},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5072678923606873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48728978633880615},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47952011227607727},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4717113673686981},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43458735942840576},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.42071372270584106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3860636353492737},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17629027366638184}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7056103348731995},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7045789361000061},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6807417869567871},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.604432225227356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468397736549377},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5096418857574463},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5072678923606873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48728978633880615},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47952011227607727},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4717113673686981},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43458735942840576},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.42071372270584106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3860636353492737},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17629027366638184},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3637732.3637779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3637732.3637779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 10th International Conference on Biomedical and Bioinformatics Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W72703661","https://openalex.org/W2063612423","https://openalex.org/W2115044025","https://openalex.org/W2160036254","https://openalex.org/W2533032450","https://openalex.org/W2903683150"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2110817230","https://openalex.org/W1606488336","https://openalex.org/W1694364829","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Structural":[0],"motifs":[1,29],"refer":[2],"to":[3,88],"patterns":[4],"in":[5,17,24],"3D":[6],"space":[7],"that":[8,20,44,84],"bear":[9],"biological":[10],"significance":[11],"as":[12],"they":[13],"can":[14,79,103],"indicate":[15],"regions":[16],"the":[18,46,51,54,61,77,89,97,101,117,120,127,139,143],"protein":[19,148],"have":[21,80],"important":[22],"roles":[23],"biochemical":[25],"functions.":[26],"Finding":[27],"structural":[28,122],"given":[30],"a":[31,67,81,93,113,132],"set":[32],"of":[33,53,100,116,142],"peptides":[34],"are":[35],"NP-hard.":[36],"Thus,":[37],"there":[38],"is":[39,56,63,85],"no":[40],"known":[41,68],"polynomial-time":[42,69],"algorithm":[43,102,144],"solves":[45],"problem":[47,62,78],"optimally":[48],"except":[49],"when":[50],"quality":[52,83],"solution":[55],"compromised.":[57],"Although":[58],"computationally":[59],"hard,":[60],"approximable":[64],"and":[65,111],"has":[66],"approximation":[70],"scheme":[71],"(PTAS).":[72],"With":[73],"an":[74],"existing":[75],"PTAS,":[76],"guaranteed":[82],"inversely":[86],"proportional":[87],"running":[90,98],"time.":[91],"For":[92],"small":[94],"error":[95],"bound,":[96],"time":[99],"become":[104],"impractical.":[105],"In":[106],"this":[107],"study,":[108],"we":[109,130],"design":[110],"implement":[112],"parallel":[114],"version":[115,141],"PTAS":[118],"for":[119],"(R-C)-compact":[121],"motif":[123],"problem.":[124],"Based":[125],"on":[126],"empirical":[128],"results,":[129],"obtained":[131],"speedup":[133],"between":[134],"4x":[135],"-":[136],"5x":[137],"from":[138],"sequential":[140],"using":[145],"three":[146],"different":[147],"data":[149],"sets.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}