Finite automata based algorithms on subsequences and supersequences of degenerate strings

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F10%3A00159191" target="_blank" >RIV/68407700:21240/10:00159191 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/10:00159191
Result on the web
<a href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B758J-4X908TM-1&_user=10&_coverDate=06%2F30%2F2010&_rdoc=4&_fmt=high&_o" target="_blank" >http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B758J-4X908TM-1&_user=10&_coverDate=06%2F30%2F2010&_rdoc=4&_fmt=high&_o</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jda.2008.10.004" target="_blank" >10.1016/j.jda.2008.10.004</a>

Result language
angličtina
Original language name
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Original language description
In this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS), Shortest Common Supersequence (SCS) and Constrained Longest Common Subsequence (CLCS) problems for degenerate strings.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)