Clustering of Protein Sequences
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F06%3APU86203" target="_blank" >RIV/00216305:26230/06:PU86203 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Clustering of Protein Sequences
Original language description
Clustering of protein sequences is one of the techniques that can be helpful for predicting secondary structure of protein. Clustering methods are based on expressing similarity or dissimilarity of such sequences. The similarity of two protein sequencescan be assessed by the score of the best alignment of the sequences. The paper deals with using formal model theory in describing this important task of bioinformatics. First, a well-known Needleman and Wunsch algorithm for finding the best alignment isintroduced. Then a finite automaton that can compute the score for the best alignment is proposed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F05%2F0723" target="_blank" >GA102/05/0723: A Framework for Formal Specifications and Prototyping of Information System's Network Applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 1st International Workshop WFM'06
ISBN
80-86840-20-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
71-78
Publisher name
NEUVEDEN
Place of publication
Přerov
Event location
Přerov
Event date
Apr 25, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—