Transducing Markov sequences
From MaRDI portal
Publication:5501935
DOI10.1145/2630065zbMath1321.68368OpenAlexW2165831358MaRDI QIDQ5501935
Christopher Re, Benny Kimelfeld
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2630065
enumerationhidden Markov modelstransducersprobabilistic databasesMarkov sequencesranked query evaluation
Database theory (68P15) Formal languages and automata (68Q45) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- On generating all maximal independent sets
- Probabilistic quantifiers and games
- Sequences, datalog, and transducers
- Learning information extraction rules for semi-structured and free text
- On the complexity of database queries
- Optimal aggregation algorithms for middleware.
- State complexity of some operations on binary regular languages
- Querying sequence databases with transducers
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Finding the k Shortest Paths
- Biological Sequence Analysis
- Factor graphs and the sum-product algorithm
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Finding the K Shortest Loopless Paths in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
This page was built for publication: Transducing Markov sequences
