НАН РА. Математические вопросы кибернетики и вычислительной техники=Mathematical problems of computer science

A dynamic programming approach for computing similarity of the protein sequences based on continuous functions comparison

Gevorgyan, Robert K. (2004) A dynamic programming approach for computing similarity of the protein sequences based on continuous functions comparison. Математические вопросы кибернетики и вычислительной техники, № 23. pp. 134-143. ISSN 0131-4645

[img] PDF
Download (1402Kb)

    Abstract

    This paper introduces a dynamic programming approach for computing "continuous" similarity of the two protein sequences. The discrete dynamic programming method considers items of each comparable sequence independently; meantime there is a strong interrelation between them. To overcome this disadvantage a "continuous" sequence comparison method is developed. Particularly, a certain continuous function is correlated to each comparable protein sequence, and then the comparison is made between those functions. Through compressions and expansions the comparable functions are brought to the most similar representation in the meaning of a certain similarity function. By this approach the sequence comparison problem is reduced to a functional maximization problem, which is numerically solved using dynamic programming method. Finally some practical results are presented with the application of described method.

    Item Type: Article
    Additional Information: Սպիտակուցային հաջորդականությունների՝ անընդհատ ֆունկցիաների վրա հիմնված նմանության հաշվարկումը դինամիկ ծրագրավորման մեթոդով։
    Uncontrolled Keywords: Գևորգյան Ռ. Կ.
    Subjects: Q Science > QA Mathematics > Computer software
    Divisions: UNSPECIFIED
    Depositing User: FSL Bibl. Dept.
    Date Deposited: 22 May 2014 15:44
    Last Modified: 14 Apr 2015 13:47
    URI: http://compsci.asj-oa.am/id/eprint/491

    Actions (login required)

    View Item