{"id":"https://openalex.org/W2281825358","doi":"https://doi.org/10.1007/978-3-642-21458-5_32","title":"A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths","display_name":"A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2281825358","doi":"https://doi.org/10.1007/978-3-642-21458-5_32","mag":"2281825358"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21458-5_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21458-5_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5111726539","display_name":"Jesper Sindahl Nielsen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Jesper Nielsen","raw_affiliation_strings":["Bioinformatics Research Centre, Aarhus University, C.F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","Bioinformatics Research Centre, Aarhus University, C.F.\u00a0M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Centre, Aarhus University, C.F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Bioinformatics Research Centre, Aarhus University, C.F.\u00a0M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111726539"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.25045464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"376","last_page":"387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9983000159263611,"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/T12254","display_name":"Machine Learning in Bioinformatics","score":0.994700014591217,"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/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.9677524566650391},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.8208247423171997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8022034764289856},{"id":"https://openalex.org/keywords/forward-algorithm","display_name":"Forward algorithm","score":0.7824838161468506},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.5598348379135132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5526443719863892},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49231207370758057},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.48688235878944397},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.48590269684791565},{"id":"https://openalex.org/keywords/maximum-entropy-markov-model","display_name":"Maximum-entropy Markov model","score":0.48334524035453796},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.4833347499370575},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45132768154144287},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4372846484184265},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43686509132385254},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36911606788635254},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.32599496841430664},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2564764618873596},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.23824423551559448},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0631561279296875}],"concepts":[{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.9677524566650391},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8208247423171997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8022034764289856},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.7824838161468506},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.5598348379135132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5526443719863892},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49231207370758057},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.48688235878944397},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.48590269684791565},{"id":"https://openalex.org/C196956702","wikidata":"https://www.wikidata.org/wiki/Q6795829","display_name":"Maximum-entropy Markov model","level":5,"score":0.48334524035453796},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.4833347499370575},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45132768154144287},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4372846484184265},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43686509132385254},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36911606788635254},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.32599496841430664},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2564764618873596},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.23824423551559448},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0631561279296875},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-21458-5_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21458-5_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/dfb53ca2-caa3-4399-8c8c-810530e4b6e4","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/dfb53ca2-caa3-4399-8c8c-810530e4b6e4","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nielsen, J 2011, 'A Coarse-to-Fine Approach to Computing the k -best Viterbi Paths', Lecture Notes in Computer Science, vol. 6661, pp. 376-387. https://doi.org/10.1007/978-3-642-21458-5_32","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1499220571","https://openalex.org/W1535015163","https://openalex.org/W1542224353","https://openalex.org/W1996159969","https://openalex.org/W2008196645","https://openalex.org/W2033243230","https://openalex.org/W2037894654","https://openalex.org/W2066721762","https://openalex.org/W2097139904","https://openalex.org/W2100796029","https://openalex.org/W2102521038","https://openalex.org/W2110647335","https://openalex.org/W2125712079","https://openalex.org/W2125838338","https://openalex.org/W2133402530","https://openalex.org/W2134599124","https://openalex.org/W2141573761","https://openalex.org/W2145703244","https://openalex.org/W2147757556","https://openalex.org/W2149681218","https://openalex.org/W2169537477","https://openalex.org/W2333081718","https://openalex.org/W2626900720","https://openalex.org/W2913240921","https://openalex.org/W4235000932","https://openalex.org/W4253573210"],"related_works":["https://openalex.org/W2062804535","https://openalex.org/W2993094530","https://openalex.org/W2143297499","https://openalex.org/W2896749479","https://openalex.org/W2073817053","https://openalex.org/W2171280163","https://openalex.org/W3093520795","https://openalex.org/W2136652457","https://openalex.org/W2148710370","https://openalex.org/W2593596363"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2016-06-24T00:00:00"}