Object

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

Journal or Publication Title:

Математические вопросы кибернетики и вычислительной техники=Կիբեռնետիկայի և հաշվողական տեխնիկայի մաթեմատիկական հարցեր=Mathematical problems of computer science

Date of publication:

2004

Volume:

23

ISSN:

0131-4645

Additional Information:

click here to follow the link

Other title:

Սպիտակուցային հաջորդականությունների՝ անընդհատ ֆունկցիաների վրա հիմնված նմանության հաշվարկումը դինամիկ ծրագրավորման մեթոդով

Coverage:

134-143

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.

Publisher:

Изд-во НАН РА

Date created:

2004-12-10

Format:

pdf

Identifier:

oai:arar.sci.am:258430

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Object collections:

Last modified:

Dec 8, 2023

In our library since:

Jul 24, 2020

Number of object content hits:

11

All available object's versions:

https://arar.sci.am/publication/281493

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Objects

Similar

This page uses 'cookies'. More information