{"id":"https://openalex.org/W2498116915","doi":"https://doi.org/10.1186/s13015-016-0081-9","title":"An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding","display_name":"An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding","publication_year":2016,"publication_date":"2016-08-05","ids":{"openalex":"https://openalex.org/W2498116915","doi":"https://doi.org/10.1186/s13015-016-0081-9","mag":"2498116915","pmid":"https://pubmed.ncbi.nlm.nih.gov/27499801"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-016-0081-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-016-0081-9","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-016-0081-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-016-0081-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006077964","display_name":"Yelena Frid","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yelena Frid","raw_affiliation_strings":["Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA USA","Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062896251","display_name":"Dan Gusfield","orcid":"https://orcid.org/0000-0002-7469-5103"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Gusfield","raw_affiliation_strings":["Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA USA","Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, UC Davis, One Shields Avenue, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006077964"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":0.1741,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.64650715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"1","first_page":"22","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9860000014305115,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9860000014305115,"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/T11482","display_name":"RNA modifications and cancer","score":0.00419999985024333,"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/T10432","display_name":"DNA and Nucleic Acid Chemistry","score":0.002099999925121665,"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/algorithm","display_name":"Algorithm","score":0.6011964678764343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5677928924560547},{"id":"https://openalex.org/keywords/folding","display_name":"Folding (DSP implementation)","score":0.4463104009628296},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08830073475837708}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6011964678764343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5677928924560547},{"id":"https://openalex.org/C2776545253","wikidata":"https://www.wikidata.org/wiki/Q5464292","display_name":"Folding (DSP implementation)","level":2,"score":0.4463104009628296},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08830073475837708},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1186/s13015-016-0081-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-016-0081-9","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-016-0081-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:27499801","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/27499801","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:ark:/13030/qt4zp2h0sd","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:escholarship.org:ark:/13030/qt4zp2h0sd","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/4zp2h0sd","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, vol 11, iss 1","raw_type":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:4974819","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/4974819","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms Mol Biol","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/s13015-016-0081-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-016-0081-9","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-016-0081-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1846764333","display_name":null,"funder_award_id":"IIS-1219278","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2498116915.pdf","grobid_xml":"https://content.openalex.org/works/W2498116915.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W79355621","https://openalex.org/W577926080","https://openalex.org/W1501400124","https://openalex.org/W1561076671","https://openalex.org/W1582035882","https://openalex.org/W1725742266","https://openalex.org/W1861164398","https://openalex.org/W1873547760","https://openalex.org/W1978336838","https://openalex.org/W1980822582","https://openalex.org/W1981576666","https://openalex.org/W1981777358","https://openalex.org/W1984675364","https://openalex.org/W1987680287","https://openalex.org/W1996951465","https://openalex.org/W2000191287","https://openalex.org/W2004945910","https://openalex.org/W2009570821","https://openalex.org/W2009818318","https://openalex.org/W2012746331","https://openalex.org/W2025763720","https://openalex.org/W2048814860","https://openalex.org/W2051713039","https://openalex.org/W2054931730","https://openalex.org/W2061158331","https://openalex.org/W2064714768","https://openalex.org/W2064790310","https://openalex.org/W2098571862","https://openalex.org/W2099386783","https://openalex.org/W2102017611","https://openalex.org/W2128267908","https://openalex.org/W2134178341","https://openalex.org/W2141157874","https://openalex.org/W2141607439","https://openalex.org/W2151625240","https://openalex.org/W2166412654","https://openalex.org/W2170472690","https://openalex.org/W2400250419","https://openalex.org/W2480569476","https://openalex.org/W2599187107","https://openalex.org/W4234667141","https://openalex.org/W4243032598","https://openalex.org/W4245668478"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"The":[0,41,230],"basic":[1],"RNA":[2,37],"secondary":[3,38],"structure":[4,39],"prediction":[5],"problem":[6,11,291],"or":[7],"single":[8,123],"sequence":[9,124],"folding":[10,62,125,228],"(SSF)":[12],"was":[13],"solved":[14],"35":[15],"years":[16],"ago":[17],"by":[18,303],"a":[19,142,270,287],"now":[20],"well-known":[21],"$$O(n^3)$$":[22],"-time":[23,131,195],"dynamic":[24],"programming":[25],"method.":[26],"Recently":[27],"three":[28,113],"methodologies\u2014Valiant,":[29],"Four-Russians,":[30],"and":[31,64,81,90,149,172,214,239,261,269,298],"Sparsification\u2014have":[32],"been":[33],"applied":[34],"to":[35,59,98,133,186,201,225,242,251,285],"speedup":[36,204,288],"prediction.":[40],"sparsification":[42],"method":[43,92,103,157],"exploits":[44],"two":[45,308],"properties":[46,72],"of":[47,52,162,205,218,254,306],"the":[48,50,56,60,65,91,94,101,120,122,146,183,216,221,226,255,265,304,307],"input:":[49],"number":[51,67,217],"subsequence":[53,219],"Z":[54,84],"with":[55,220],"endpoints":[57],"belonging":[58,224],"optimal":[61,227],"set":[63],"maximum":[66],"base-pairs":[68],"L.":[69],"These":[70],"sparsity":[71,256],"satisfy":[73],"$$0":[74],"\\le":[75,77,83,85,168,176,211],"L":[76],"n":[78],"/":[79,87],"2$$":[80,88],"$$n":[82],"n^2":[86],",":[89,164],"reduces":[93],"algorithmic":[95,115],"running":[96,160],"time":[97,161],"O(LZ).":[99],"While":[100],"Four-Russians":[102,126,153,184,281],"utilizes":[104],"tabling":[105],"partial":[106],"results.":[107],"In":[108],"this":[109,279],"paper,":[110],"we":[111,140,181,276],"explore":[112],"different":[114],"speedups.":[116],"We":[117],"first":[118],"expand":[119],"reformulate":[121],"$$\\Theta":[127],"\\left(\\frac{n^3}{\\log":[128],"^2":[129],"n}\\right)$$":[130,171,178,213],"algorithm,":[132],"utilize":[134],"an":[135,188,202],"on-demand":[136,152,189,231],"lookup":[137],"table.":[138],"Second,":[139],"create":[141],"framework":[143,282],"that":[144,278,293],"combines":[145],"fastest":[147,151],"Sparsification":[148],"new":[150],"methods.":[154],"This":[155,198],"combined":[156],"has":[158],"worst-case":[159],"$$O(\\tilde{L}\\tilde{Z})$$":[163],"where":[165,207],"$$\\frac{{L}}{\\log":[166],"n}":[167],"\\tilde{L}\\le":[169],"min\\left({L},\\frac{n}{\\log":[170],"$$\\frac{{Z}}{\\log":[173],"n}\\le":[174,209],"\\tilde{Z}":[175],"min\\left({Z},\\frac{n^2}{\\log":[177],".":[179],"Third":[180],"update":[182],"formulation":[185,232],"achieve":[187,286],"$$O(":[190],"n^2/":[191],"\\log":[192],"^2n":[193],")$$":[194],"parallel":[196],"algorithm.":[197],"then":[199],"leads":[200,249],"asymptotic":[203,259],"$$O(\\tilde{L}\\tilde{Z_j})$$":[206],"$$\\frac{{Z_j}}{\\log":[208],"\\tilde{Z_j}":[210],"min\\left({Z_j},\\frac{n}{\\log":[212],"$$Z_j$$":[215],"endpoint":[222],"j":[223],"set.":[229],"not":[233],"only":[234],"removes":[235],"all":[236],"extraneous":[237],"computation":[238],"allows":[240],"us":[241,250],"incorporate":[243],"more":[244,271],"realistic":[245],"scoring":[246,274],"schemes,":[247],"but":[248],"take":[252],"advantage":[253],"properties.":[257],"Through":[258],"analysis":[260],"empirical":[262],"testing":[263],"on":[264,289],"base-pair":[266],"maximization":[267],"variant":[268],"biologically":[272],"informative":[273],"scheme,":[275],"show":[277],"Sparse":[280],"is":[283,294],"able":[284],"every":[290],"instance,":[292],"asymptotically":[295],"never":[296],"worse,":[297],"empirically":[299],"better":[300],"than":[301],"achieved":[302],"minimum":[305],"methods":[309],"alone.":[310]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}