{"id":"https://openalex.org/W2006724349","doi":"https://doi.org/10.3390/a7010062","title":"Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems","display_name":"Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems","publication_year":2014,"publication_date":"2014-03-07","ids":{"openalex":"https://openalex.org/W2006724349","doi":"https://doi.org/10.3390/a7010062","mag":"2006724349"},"language":"en","primary_location":{"id":"doi:10.3390/a7010062","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7010062","pdf_url":"https://www.mdpi.com/1999-4893/7/1/62/pdf?version=1394543648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"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","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/7/1/62/pdf?version=1394543648","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086259996","display_name":"Robert Giegerich","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Robert Giegerich","raw_affiliation_strings":["Faculty of Technology and Center for Biotechnology, Bielefeld University, Bielefeld 33594, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Technology and Center for Biotechnology, Bielefeld University, Bielefeld 33594, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049507162","display_name":"H\u00e9l\u00e8ne Touzet","orcid":"https://orcid.org/0000-0001-5305-9987"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]},{"id":"https://openalex.org/I4210160005","display_name":"Computer Science Laboratory of Lille","ror":null,"country_code":"FR","type":null,"lineage":["https://openalex.org/I4210160005"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"H\u00b4el'ene Touzet","raw_affiliation_strings":["LIFL (UMR CNRS 8022, University of Lille) and INRIA, Villeneuve d'Ascq Cedex 59655, France","Bioinformatics and Sequence Analysis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIFL (UMR CNRS 8022, University of Lille) and INRIA, Villeneuve d'Ascq Cedex 59655, France","institution_ids":["https://openalex.org/I4210160005","https://openalex.org/I1326498283","https://openalex.org/I2279609970","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Bioinformatics and Sequence Analysis","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.3959,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80200241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"1","first_page":"62","last_page":"144"},"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.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9969000220298767,"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.7037318348884583},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6446494460105896},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5831655859947205},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5365505218505859},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.49997997283935547},{"id":"https://openalex.org/keywords/generic-programming","display_name":"Generic programming","score":0.47929778695106506},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.477964848279953},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4673573970794678},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.4546038508415222},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43127983808517456},{"id":"https://openalex.org/keywords/reactive-programming","display_name":"Reactive programming","score":0.4254530072212219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3451080918312073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3314518928527832},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.3309265375137329},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25887101888656616},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.24181202054023743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2287152111530304}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7037318348884583},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6446494460105896},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5831655859947205},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5365505218505859},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.49997997283935547},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.47929778695106506},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.477964848279953},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4673573970794678},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.4546038508415222},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43127983808517456},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.4254530072212219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3451080918312073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3314518928527832},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3309265375137329},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25887101888656616},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.24181202054023743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2287152111530304},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3390/a7010062","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7010062","pdf_url":"https://www.mdpi.com/1999-4893/7/1/62/pdf?version=1394543648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"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","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01084318v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01084318","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2014, 7, pp.62 - 144. ⟨10.3390/a7010062⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:9685cc8ac2034bf98033e67c2612e5cc","is_oa":true,"landing_page_url":"https://doaj.org/article/9685cc8ac2034bf98033e67c2612e5cc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 7, Iss 1, Pp 62-144 (2014)","raw_type":"article"},{"id":"pmh:oai:lilloa.univ-lille.fr:20.500.12210/25808","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12210/25808","pdf_url":null,"source":{"id":"https://openalex.org/S4306402203","display_name":"LillOA (Universit\u00e9 de Lille (University Of Lille))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210123514","host_organization_name":"Centre d'Etudes en Civilisations, Langues et Litt\u00e9ratures Etrang\u00e8res","host_organization_lineage":["https://openalex.org/I4210123514"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mdpi.com:/1999-4893/7/1/62/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a7010062","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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; Volume 7; Issue 1; Pages: 62-144","raw_type":"Text"},{"id":"pmh:oai:pub.librecat.org:2905757","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2905757","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Giegerich R, Touzet H. Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems. <em>Algorithms</em>. 2014;7(1):62-144.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.3390/a7010062","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7010062","pdf_url":"https://www.mdpi.com/1999-4893/7/1/62/pdf?version=1394543648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"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","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2006724349.pdf","grobid_xml":"https://content.openalex.org/works/W2006724349.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W139823962","https://openalex.org/W155540824","https://openalex.org/W165195483","https://openalex.org/W938539187","https://openalex.org/W1487318296","https://openalex.org/W1517658539","https://openalex.org/W1538726234","https://openalex.org/W1552961498","https://openalex.org/W1566149701","https://openalex.org/W1574721051","https://openalex.org/W1583295953","https://openalex.org/W1650673748","https://openalex.org/W1861164398","https://openalex.org/W1964071625","https://openalex.org/W1976021976","https://openalex.org/W1977046142","https://openalex.org/W1978872422","https://openalex.org/W1987010534","https://openalex.org/W1990061958","https://openalex.org/W1993259745","https://openalex.org/W1998894153","https://openalex.org/W2000319736","https://openalex.org/W2008288996","https://openalex.org/W2009570821","https://openalex.org/W2011368877","https://openalex.org/W2047706513","https://openalex.org/W2054931730","https://openalex.org/W2068448872","https://openalex.org/W2074231493","https://openalex.org/W2079969024","https://openalex.org/W2080144938","https://openalex.org/W2081574366","https://openalex.org/W2087064593","https://openalex.org/W2095145214","https://openalex.org/W2096306683","https://openalex.org/W2096669340","https://openalex.org/W2105070391","https://openalex.org/W2108584692","https://openalex.org/W2113657563","https://openalex.org/W2129595335","https://openalex.org/W2137526645","https://openalex.org/W2142676309","https://openalex.org/W2147828873","https://openalex.org/W2150563643","https://openalex.org/W2156501361","https://openalex.org/W2171643895","https://openalex.org/W2341171179","https://openalex.org/W2487144912","https://openalex.org/W2752885492","https://openalex.org/W4212877087","https://openalex.org/W4230919050","https://openalex.org/W4245668478","https://openalex.org/W6629025732","https://openalex.org/W6640836790","https://openalex.org/W6644661286"],"related_works":["https://openalex.org/W2022585506","https://openalex.org/W2254582632","https://openalex.org/W3022954388","https://openalex.org/W1177194838","https://openalex.org/W1567814706","https://openalex.org/W2110317952","https://openalex.org/W2886887129","https://openalex.org/W1551181895","https://openalex.org/W2955825290","https://openalex.org/W1545099940"],"abstract_inverted_index":{"Dynamic":[0],"programming":[1,67,158,193],"is":[2],"a":[3,13,61,95,137,188],"classical":[4],"algorithmic":[5],"paradigm,":[6],"which":[7,195],"often":[8,42],"allows":[9],"the":[10,126,133,180,198],"evaluation":[11],"of":[12,16,26,34,75,91,128,136,156,182,191,200],"search":[14],"space":[15],"exponential":[17],"size":[18],"in":[19,94,197,205],"polynomial":[20],"time.":[21],"Recursive":[22],"problem":[23,143,146],"decomposition,":[24],"tabulation":[25],"intermediate":[27],"results":[28],"for":[29,64],"re-use,":[30],"and":[31,45,53,98,107,207],"Bellman\u2019s":[32],"Principle":[33],"Optimality":[35],"are":[36,46],"its":[37],"well-understood":[38],"ingredients.":[39],"However,":[40],"algorithms":[41],"lack":[43],"abstraction":[44],"difficult":[47],"to":[48,51,55,145,151],"implement,":[49],"tedious":[50],"debug,":[52],"delicate":[54],"modify.":[56],"The":[57,116,176],"present":[58,177],"article":[59,178],"proposes":[60],"generic":[62],"framework":[63,70],"specifying":[65],"dynamic":[66,157,192],"problems.":[68],"This":[69,148],"can":[71,172],"handle":[72],"all":[73,100],"kinds":[74],"sequential":[76],"inputs,":[77],"as":[78,80,112,132,168],"well":[79],"tree-structured":[81],"data.":[82],"Biosequence":[83],"analysis,":[84,89],"document":[85],"processing,":[86],"molecular":[87,208],"structure":[88,209],"comparison":[90],"objects":[92],"assembled":[93],"hierarchic":[96],"fashion,":[97],"generally,":[99],"domains":[101],"come":[102],"under":[103],"consideration":[104],"where":[105],"strings":[106],"ordered,":[108],"rooted":[109],"trees":[110],"serve":[111],"natural":[113],"data":[114],"representations.":[115],"new":[117,184],"approach":[118,185],"introduces":[119],"inverse":[120,134],"coupled":[121],"rewrite":[122,139],"systems.":[123],"They":[124],"describe":[125],"solutions":[127,144],"combinatorial":[129],"optimization":[130],"problems":[131,194],"image":[135],"term":[138],"relation":[140],"that":[141],"reduces":[142],"inputs.":[147],"specification":[149],"leads":[150],"concise":[152],"yet":[153],"translucent":[154],"specifications":[155],"algorithms.":[159],"Their":[160],"actual":[161],"implementation":[162],"may":[163],"be":[164,173],"challenging,":[165],"but":[166],"eventually,":[167],"we":[169],"hope,":[170],"it":[171],"produced":[174],"automatically.":[175],"demonstrates":[179],"scope":[181],"this":[183],"by":[186],"describing":[187],"diverse":[189],"set":[190],"arise":[196],"domain":[199],"computational":[201],"biology,":[202],"with":[203],"examples":[204],"biosequence":[206],"analysis.":[210]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-10T07:45:09.275182","created_date":"2016-06-24T00:00:00"}