Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence.
Yoshifumi SakaiPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- directed acyclic graph
- totally ordered
- partially ordered
- equivalence class
- equivalence classes
- conditional independence
- directed graph
- causal models
- random variables
- transitive closure
- bayesian network structures
- pairwise
- event calculus
- structural learning
- partial order
- bayesian network structure
- pattern matching
- structural equation models