{"id":"https://openalex.org/W2575589225","doi":"https://doi.org/10.1109/bibm.2016.7822598","title":"qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem","display_name":"qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2575589225","doi":"https://doi.org/10.1109/bibm.2016.7822598","mag":"2575589225"},"language":"en","primary_location":{"id":"doi:10.1109/bibm.2016.7822598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm.2016.7822598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100777526","display_name":"Peng Xiao","orcid":"https://orcid.org/0000-0001-5566-0207"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peng Xiao","raw_affiliation_strings":["Computer Science and Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086885083","display_name":"Soumitra Pal","orcid":"https://orcid.org/0000-0003-4840-3944"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soumitra Pal","raw_affiliation_strings":["Computer Science and Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanguthevar Rajasekaran","raw_affiliation_strings":["Computer Science and Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":1.1648,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8274264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":null,"first_page":"670","last_page":"675"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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.9987999796867371,"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/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9922000169754028,"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.9850000143051147,"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/motif","display_name":"Motif (music)","score":0.8893340826034546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6385273933410645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3794754147529602},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3662186861038208}],"concepts":[{"id":"https://openalex.org/C32276052","wikidata":"https://www.wikidata.org/wiki/Q908349","display_name":"Motif (music)","level":2,"score":0.8893340826034546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6385273933410645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3794754147529602},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3662186861038208},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bibm.2016.7822598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm.2016.7822598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1580213736","https://openalex.org/W1985716977","https://openalex.org/W2023863508","https://openalex.org/W2038555630","https://openalex.org/W2042587503","https://openalex.org/W2073719763","https://openalex.org/W2075277509","https://openalex.org/W2089026820","https://openalex.org/W2115273783","https://openalex.org/W2136043658","https://openalex.org/W2148103646","https://openalex.org/W2155976638","https://openalex.org/W2157907093","https://openalex.org/W2158199799","https://openalex.org/W2163923149","https://openalex.org/W2514939031","https://openalex.org/W6634719314"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W3170299350","https://openalex.org/W2368410102","https://openalex.org/W2605676258","https://openalex.org/W2368037387","https://openalex.org/W190186656","https://openalex.org/W2902352756","https://openalex.org/W2377079823","https://openalex.org/W2599962286"],"abstract_inverted_index":{"Discovering":[0],"patterns":[1,17],"in":[2,48,173],"biological":[3],"sequences":[4],"is":[5,55,69,114,132],"very":[6],"important":[7],"to":[8,85,103,125,180],"extract":[9],"useful":[10],"information":[11],"from":[12],"them.":[13],"Motifs":[14],"are":[15],"crucial":[16],"that":[18,59,155],"have":[19,45],"numerous":[20],"applications":[21],"including":[22,186],"the":[23,49,107,160,167,206],"identification":[24],"of":[25,38,43,57,80,141,208],"transcription":[26],"factors":[27],"and":[28,116,128,151,191,204],"their":[29],"binding":[30],"sites,":[31],"composite":[32],"regulatory":[33],"patterns,":[34],"similiarity":[35],"between":[36],"families":[37],"proteins,":[39],"etc.":[40],"Several":[41],"models":[42],"motifs":[44],"been":[46,61,83],"proposed":[47],"literature.":[50],"The":[51,64,77],"(l,":[52,65,121],"d)-motif":[53,66,122],"model":[54],"one":[56],"these":[58],"has":[60,82,205],"studied":[62],"widely.":[63],"search":[67,184],"problem":[68,79],"also":[70,177],"known":[71,109],"as":[72,95,97],"Planted":[73],"Motif":[74,188,194],"Search":[75,189,195],"(PMS).":[76],"general":[78],"PMS":[81,113],"proven":[84],"be":[86,178,201],"NP-hard.":[87],"In":[88],"this":[89],"paper,":[90],"we":[91,171],"present":[92],"an":[93],"elegant":[94],"well":[96],"efficient":[98],"randomized":[99,157],"algorithm,":[100],"named":[101],"qPMS10,":[102],"solve":[104,119,181],"PMS.":[105,165],"Currently,":[106],"best":[108],"algorithm":[110,158,175,199],"for":[111,163],"solving":[112,164],"qPMS9":[115,131,144],"it":[117],"can":[118,176,200],"challenging":[120],"instances":[123],"up":[124],"(28,":[126],"12)":[127],"(30,":[129],"13).":[130],"a":[133,138],"deterministic":[134],"algorithm.":[135],"We":[136],"provide":[137],"performance":[139],"comparison":[140],"qPMS10":[142],"with":[143],"on":[145,212],"standard":[146],"benchmark":[147],"datasets.":[148],"Both":[149],"theoretical":[150],"empirical":[152],"analysis":[153],"demonstrate":[154],"our":[156,174,198],"outperforms":[159],"exsiting":[161],"algorithms":[162],"Besides,":[166],"random":[168],"sampling":[169],"techniques":[170],"employ":[172],"extended":[179],"other":[182],"motif":[183],"problems":[185],"Simple":[187],"(SMS)":[190],"Edit-distance":[192],"based":[193],"(EMS).":[196],"Furthermore,":[197],"parallelized":[202],"efficiently":[203],"potential":[207],"yielding":[209],"great":[210],"speedups":[211],"multi-core":[213],"machines.":[214]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}