Rezumat articol ediţie STUDIA UNIVERSITATIS BABE┼×-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.2 din 2012  
         
  Articol:   A STUDY ON USING ASSOCIATION RULES FOR PREDICTING PROMOTER SEQUENCES.

Autori:  .
 
       
         
  Rezumat:  

The problem of promoter identification in DNA sequences is of major importance within bioinformatics. As the conditions for a region of DNA to function as a promoter are not known, machine learning based classification models are still developed to approach this problem. Relational association rules are a particular type of association rules and describe numerical orderings between attributes that commonly occur over a data set. This paper aims to investigate a classification model based on relational association rules mining for the problem of promoter sequences prediction. Some further extensions to this model are introduced and we provide a comparison of the original algorithm with its newly introduced versions.

Key words and phrases. Bioinformatics, Promoter Sequences Prediction, Machine Learning, Association Rule Mining.

 
         
     
         
         
      Revenire la pagina precedentă