Transducing Markov sequences
From MaRDI portal
Publication:5501935
Recommendations
- Querying sequence databases with transducers
- Sequences, datalog, and transducers
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
- Moments of the count of a regular expression in a heterogeneous random sequence
- scientific article; zbMATH DE number 1773097
Cites work
- scientific article; zbMATH DE number 1953124 (Why is no real title available?)
- scientific article; zbMATH DE number 910913 (Why is no real title available?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Biological Sequence Analysis
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Factor graphs and the sum-product algorithm
- Finding the K Shortest Loopless Paths in a Network
- Finding the k Shortest Paths
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Learning information extraction rules for semi-structured and free text
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- On generating all maximal independent sets
- On the complexity of database queries
- Optimal aggregation algorithms for middleware.
- Probabilistic quantifiers and games
- Querying sequence databases with transducers
- Sequences, datalog, and transducers
- State complexity of some operations on binary regular languages
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The complexity of computing the permanent
This page was built for publication: Transducing Markov sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501935)
