Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments
    
    
  
  
  
      
      
      
        
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 1, pp. 172-189
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.
            
            
            
          
        
      @article{ZVMMF_2006_46_1_a15,
     author = {A. V. Kel'manov and L. V. Mikhailova},
     title = {Joint detection of a~given number of reference fragments in a~quasi-periodic sequence and its partition into segments containing series of identical fragments},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {172--189},
     publisher = {mathdoc},
     volume = {46},
     number = {1},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_1_a15/}
}
                      
                      
                    TY - JOUR AU - A. V. Kel'manov AU - L. V. Mikhailova TI - Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2006 SP - 172 EP - 189 VL - 46 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_1_a15/ LA - ru ID - ZVMMF_2006_46_1_a15 ER -
%0 Journal Article %A A. V. Kel'manov %A L. V. Mikhailova %T Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 2006 %P 172-189 %V 46 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_1_a15/ %G ru %F ZVMMF_2006_46_1_a15
A. V. Kel'manov; L. V. Mikhailova. Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 1, pp. 172-189. http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_1_a15/
