The consensus string problem and the complexity of comparing hidden Markov models
Journal of Computer and System Sciences - Computational biology 2002
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Complexity of Comparing Hidden Markov Models
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the structure of hidden Markov models
Pattern Recognition Letters
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
SMArTIC: towards building an accurate, robust and scalable specification miner
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A new distance measure for hidden Markov models
Expert Systems with Applications: An International Journal
Fuzzy Sets and Systems
A bibliographical study of grammatical inference
Pattern Recognition
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
| Hi-index | 0.00 |