Approximate swapped matching

Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version P′ of P is a length m string derived from P by a series of local swaps (i.e., p′ ℓ← p ℓ+1 and p′ ℓ+1← p ℓ), where each element can participate in no more than one swap. The Pattern Matchi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 83; číslo 1; s. 33 - 39
Hlavní autoři:	Amir, Amihood, Lewenstein, Moshe, Porat, Ely
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.07.2002 Elsevier Science Elsevier Sequoia S.A
Témata:	Algebra Algorithms Applied sciences Approximate pattern matching Artificial intelligence Classical and quantum physics: mechanics and fields Classical combinatorial problems Classical mechanics of discrete systems: general mathematical aspects Combinatorial algorithms on words Combinatorics Combinatorics. Ordered structures Computer programming Computer science; control theory; systems Design and analysis of algorithms Exact sciences and technology Mathematics Non-standard pattern matching Number theory Pattern matching Pattern matching with swaps Pattern recognition. Digital image processing. Computational geometry Physics Sciences and techniques of general use Studies Pattern matching with swaps Non-standard pattern matching Combinatorial algorithms on words Design and analysis of algorithms Pattern matching Approximate pattern matching Design Word Combinatorial problem Combinatorial algorithm Nonstandard analysis Algorithm Algorithm analysis
ISSN:	0020-0190, 1872-6119
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!