{"id":"https://openalex.org/W2049126137","doi":"https://doi.org/10.1109/tpami.1986.4767813","title":"Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings","display_name":"Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings","publication_year":1986,"publication_date":"1986-07-01","ids":{"openalex":"https://openalex.org/W2049126137","doi":"https://doi.org/10.1109/tpami.1986.4767813","mag":"2049126137"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.1986.4767813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.1986.4767813","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-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/A5001169337","display_name":"Michael G. Thomason","orcid":"https://orcid.org/0000-0001-8625-9184"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael G. Thomason","raw_affiliation_strings":["Department of Computer Science, University of Tennessee, Knoxville, TN, USA","[Department of Computer Science, University of Tennessee, Knoxville, TN 37996.]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"[Department of Computer Science, University of Tennessee, Knoxville, TN 37996.]","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028026306","display_name":"Erik Granum","orcid":null},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Erik Granum","raw_affiliation_strings":["Institute for Electronic Systems, University of Aalborg, Aalborg, Denmark","[Institute for Electronic Systems, Aalborg University, Aalborg 9000, Denmark.]"],"affiliations":[{"raw_affiliation_string":"Institute for Electronic Systems, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"[Institute for Electronic Systems, Aalborg University, Aalborg 9000, Denmark.]","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001169337"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":null,"apc_paid":null,"fwci":4.1308,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94428254,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"PAMI-8","issue":"4","first_page":"491","last_page":"501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9954000115394592,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/dynamic-programming","display_name":"Dynamic programming","score":0.6551425457000732},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.6497001647949219},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6248894929885864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6008257269859314},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5987574458122253},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.5771939754486084},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5564000606536865},{"id":"https://openalex.org/keywords/stochastic-matrix","display_name":"Stochastic matrix","score":0.4725118577480316},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.47153955698013306},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46014416217803955},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4225202202796936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42156416177749634},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.42081156373023987},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.417320191860199},{"id":"https://openalex.org/keywords/grammar-induction","display_name":"Grammar induction","score":0.414591908454895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27253270149230957},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.24798759818077087},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08908042311668396}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6551425457000732},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6497001647949219},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6248894929885864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6008257269859314},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5987574458122253},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.5771939754486084},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5564000606536865},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.4725118577480316},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.47153955698013306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46014416217803955},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4225202202796936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42156416177749634},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.42081156373023987},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.417320191860199},{"id":"https://openalex.org/C56601403","wikidata":"https://www.wikidata.org/wiki/Q5593673","display_name":"Grammar induction","level":3,"score":0.414591908454895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27253270149230957},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.24798759818077087},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08908042311668396},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpami.1986.4767813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.1986.4767813","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/46290b20-15ae-11dc-a5a4-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/46290b20-15ae-11dc-a5a4-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thomason , M G & Granum , E 1986 , ' Dynamic programming inference of Markov networks from finite sets of sample strings ' , IEEE Transaction on Pattern Analysis and Machine Intelligence , vol. 8 , no. 4 , pp. 491-501 . https://doi.org/10.1109/TPAMI.1986.4767813","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W158805393","https://openalex.org/W1575431606","https://openalex.org/W1970026646","https://openalex.org/W1980539750","https://openalex.org/W1991697817","https://openalex.org/W2007321142","https://openalex.org/W2037288520","https://openalex.org/W2056859449","https://openalex.org/W2061315523","https://openalex.org/W2074584543","https://openalex.org/W2147611619","https://openalex.org/W2171850596","https://openalex.org/W2623408274","https://openalex.org/W4252624325"],"related_works":["https://openalex.org/W2146188408","https://openalex.org/W2783181938","https://openalex.org/W2884768918","https://openalex.org/W2149353983","https://openalex.org/W2171612762","https://openalex.org/W4289753429","https://openalex.org/W2734551807","https://openalex.org/W2026530380","https://openalex.org/W3044198794","https://openalex.org/W1520319263"],"abstract_inverted_index":{"Inference":[0],"of":[1,7,35,41,54],"Markov":[2],"networks":[3],"from":[4],"finite":[5],"sets":[6],"sample":[8,51],"strings":[9],"is":[10,63],"formulated":[11],"using":[12],"dynamic":[13,29],"programming.":[14],"Strings":[15],"are":[16,58],"installed":[17],"in":[18],"a":[19,28],"network":[20,57],"sequentially":[21],"via":[22],"optimal":[23],"string-to-network":[24],"alignments":[25],"computed":[26],"with":[27,65,69],"programming":[30],"matrix,":[31],"the":[32,50,61],"cost":[33],"function":[34],"which":[36],"uses":[37],"relative":[38],"frequency":[39],"estimates":[40],"transition":[42],"probabilities":[43],"to":[44,49],"emphasize":[45],"landmark":[46],"substrings":[47],"common":[48],"set.":[52],"Properties":[53],"an":[55],"inferred":[56],"described":[59],"and":[60,68],"method":[62],"illustrated":[64],"artificial":[66],"data":[67,70],"representing":[71],"banded":[72],"human":[73],"chromosomes.":[74]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}