Searching All Seeds of Strings with Hamming Distance using Finite Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00150773" target="_blank" >RIV/68407700:21230/09:00150773 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Searching All Seeds of Strings with Hamming Distance using Finite Automata
Original language description
Seed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstring of T under some distance rule. In this paper, the problem of all restricted seeds with the smallest Hamming distanceis studied and a polynomial time and space algorithm for solving the problem is presented. It searches for all restricted approximate seeds of a string with given limited approximation using Hamming distance and it computes the smallest distance for eachfound seed. The solution is based on a finite (suffix) automata approach that provides a straightforward way to design algorithms to many problems in stringology. Therefore, it is shown that the set of problems solvable using finite automata includes the one studied in this paper.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Article name in the collection
IMECS 2009: International MultiConference of Engineers and Computer Scientists
ISBN
978-988-17012-2-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
The International Association of Engineers IAENG
Place of publication
Hong Kong
Event location
Hongkong
Event date
Mar 18, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000266097200119

Similar results(10)