{"id":"https://openalex.org/W4399729305","doi":"https://doi.org/10.1109/tsp.2024.3415468","title":"Marginalized Beam Search Algorithms for Hierarchical HMMs","display_name":"Marginalized Beam Search Algorithms for Hierarchical HMMs","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4399729305","doi":"https://doi.org/10.1109/tsp.2024.3415468"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2024.3415468","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2024.3415468","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Signal Processing","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/A5088445106","display_name":"Xuechun Xu","orcid":"https://orcid.org/0000-0003-1850-0946"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Xuechun Xu","raw_affiliation_strings":["Division of Information Science and Engineering, KTH, Royal Institution of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Information Science and Engineering, KTH, Royal Institution of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059936184","display_name":"Joakim Jald\u00e9n","orcid":"https://orcid.org/0000-0001-6630-243X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Joakim Jald\u00e9n","raw_affiliation_strings":["Division of Information Science and Engineering, KTH, Royal Institution of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Information Science and Engineering, KTH, Royal Institution of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088445106"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.695,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73964975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"72","issue":null,"first_page":"3013","last_page":"3027"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9717000126838684,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9717000126838684,"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/algorithm","display_name":"Algorithm","score":0.5780139565467834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5673547387123108},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.43451473116874695},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3749382197856903},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35460197925567627},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.3430822789669037},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34036463499069214},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.17208415269851685},{"id":"https://openalex.org/keywords/radar","display_name":"Radar","score":0.10209950804710388}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5780139565467834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5673547387123108},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.43451473116874695},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3749382197856903},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35460197925567627},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.3430822789669037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34036463499069214},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.17208415269851685},{"id":"https://openalex.org/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.10209950804710388}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2024.3415468","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2024.3415468","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G4699116860","display_name":null,"funder_award_id":"QuantumSense [VR 2018-06169]","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W15592790","https://openalex.org/W1567992687","https://openalex.org/W1601419553","https://openalex.org/W1996356785","https://openalex.org/W2001496424","https://openalex.org/W2062804535","https://openalex.org/W2068856084","https://openalex.org/W2076618452","https://openalex.org/W2093658107","https://openalex.org/W2114850508","https://openalex.org/W2119357806","https://openalex.org/W2127141656","https://openalex.org/W2141389982","https://openalex.org/W2162910164","https://openalex.org/W2550586733","https://openalex.org/W2591367881","https://openalex.org/W2746192915","https://openalex.org/W2789843538","https://openalex.org/W2949279762","https://openalex.org/W3163074978","https://openalex.org/W4389436393","https://openalex.org/W6633641140","https://openalex.org/W6646856096","https://openalex.org/W6675365184","https://openalex.org/W6682003881"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"Inferring":[0],"a":[1,5,10],"state":[2,51,73,104],"sequence":[3,6,105],"from":[4],"of":[7,118],"measurements":[8],"is":[9],"fundamental":[11],"problem":[12],"in":[13,48],"bioinformatics":[14],"and":[15,21,89,113,128],"natural":[16],"language":[17],"processing.":[18],"The":[19,53],"Viterbi":[20,54,111],"the":[22,44,49,65,84,90,100,110,116],"Beam":[23],"Search":[24],"(BS)":[25],"algorithms":[26,79,120],"are":[27],"popular":[28],"inference":[29],"methods,":[30],"but":[31],"they":[32,98],"have":[33],"limitations":[34],"when":[35,43],"applied":[36],"to":[37,80],"Hierarchical":[38],"Hidden":[39],"Markov":[40],"Models":[41],"(HHMMs),":[42],"primary":[45],"interest":[46],"lies":[47],"outer":[50,59,103],"sequence.":[52],"algorithm":[55,67,88],"can":[56],"not":[57],"infer":[58],"states":[60],"without":[61],"inner":[62],"states,":[63],"while":[64],"BS":[66,87,93],"requires":[68],"marginalization":[69],"over":[70],"prohibitively":[71],"large":[72],"spaces.":[74],"We":[75,95],"propose":[76],"two":[77],"new":[78],"overcome":[81],"these":[82,119],"limitations:":[83],"greedy":[85],"marginalized":[86],"local":[91],"focus":[92],"algorithm.":[94],"show":[96],"that":[97],"approximate":[99],"most":[101],"likely":[102],"with":[106,126],"higher":[107],"performance":[108,117],"than":[109],"algorithm,":[112],"we":[114],"evaluate":[115],"on":[121],"an":[122],"explicit":[123],"duration":[124],"HMM":[125],"simulated":[127],"real":[129],"nanopore":[130],"base":[131],"calling":[132],"data.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}