Optimized mixed Markov models for motif identification
نویسندگان
چکیده
منابع مشابه
Optimized Markov state models for metastable systems.
A method is proposed to identify target states that optimize a metastability index amongst a set of trial states and use these target states as milestones (or core sets) to build Markov State Models (MSMs). If the optimized metastability index is small, this automatically guarantees the accuracy of the MSM, in the sense that the transitions between the target milestones is indeed approximately ...
متن کاملMarkov Mixed Membership Models
We present a Markov mixed membership model (Markov M3) for grouped data that learns a fully connected graph structure among mixing components. A key feature of Markov M3 is that it interprets the mixed membership assignment as a Markov random walk over this graph of nodes. This is in contrast to tree-structured models in which the assignment is done according to a tree structure on the mixing c...
متن کاملMixed Markov models.
Markov random fields can encode complex probabilistic relationships involving multiple variables and admit efficient procedures for probabilistic inference. However, from a knowledge engineering point of view, these models suffer from a serious limitation. The graph of a Markov field must connect all pairs of variables that are conditionally dependent even for a single choice of values of the o...
متن کاملCreating hidden Markov models for fast speech by optimized clustering
Previous studies have shown that the recognition accu racy often severely degrades at higher speech rates which can basically be traced back to two main dimensions acoustic and phonemic Reasons for this e ect can be found in the phonemic eld e g elisions as well as on the acoustic level with increasing rates of speech the spec tral characteristics are changing A main obstacle in this context is...
متن کاملMarkov Models for Identification of Significant Episodes
We propose a new method for a reliable identification of significant sequential episodes occurring within a window of size w in an event sequence modeled by a Markov source. As a measure of significance we use Ω∃(n,w), the number of windows containing the episode as a subsequence. We prove that Ω∃(n, w) is a sum of a φ-mixing sequence of random variables and therefore obeys the central limit th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2006
ISSN: 1471-2105
DOI: 10.1186/1471-2105-7-279