A Probabilistic Model For Sequence Analysis

International Journal of Computer Science and Information Security 01/2010;
Source: DOAJ

ABSTRACT This paper presents a probabilistic approach for DNA sequence analysis. A DNA sequence consists of an arrangement of the four nucleotides A, C, T and G and different representation schemes are presented according to a probability measure associated with them. There are different ways that probability can be associated with the DNA sequence: one way is when the probability of an occurrence of a letter does not depend on the previous one (termed as unsuccessive probability) and in another scheme the probability of occurrence of a letter depends on its previous letter (termed as successive probability). Further, based on these probability measures graphical representations of the schemes are also presented. Using the diagram probability measure one can easily calculate an associated probability measure which can serve as a parameter to check how close is a new sequence to already existing ones.

Download full-text


Available from: Gyanaranjan Sahoo, Sep 26, 2015
1 Follower
15 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Some relations among approaches that have been applied to estimating models for acoustic signals in speech recognition systems are examined. In particular, the modeling approaches based on maximum likelihood (ML), maximum mutual information (MMI), and minimum discrimination information (MDI) are studied. It is shown that all three approaches can be formulated uniformly as MDI modeling approaches for simultaneous estimation of the acoustic models for all words in the vocabulary and that none of the approaches requires any model correctness assumption. The three approaches differ in the effective source being modeled and in the probability distribution attributed to this source
    IEEE Transactions on Information Theory 04/1990; 36(2-36):372 - 380. DOI:10.1109/18.52483 · 2.33 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This tutorial provides an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and gives practical details on methods of implementation of the theory along with a description of selected applications of the theory to distinct problems in speech recognition. Results from a number of original sources are combined to provide a single source of acquiring the background required to pursue further this area of research. The author first reviews the theory of discrete Markov chains and shows how the concept of hidden states, where the observation is a probabilistic function of the state, can be used effectively. The theory is illustrated with two simple examples, namely coin-tossing, and the classic balls-in-urns system. Three fundamental problems of HMMs are noted and several practical techniques for solving these problems are given. The various types of HMMs that have been studied, including ergodic as well as left-right models, are described
    Proceedings of the IEEE 03/1989; 77(2-77):257 - 286. DOI:10.1109/5.18626 · 4.93 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: During the last three decades the researches much attention about the mothers and newborn health. Haemoglobin count is one of the main factors in mothers and baby health. The main objective of this paper, to analysis the haemoglobin count for mothers and newborn, uses moments of geometric distribution and equilibrium state. The magnitude of the fall in haemoglobin concentration in pregnancy is related to mothers and babies health, failure of haemoglobin concentration may be indicates risk of mothers and babies health.