Efficient special cases of Pattern Matching with Swaps

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 68; H. 3; S. 125 - 132
Hauptverfasser:	Amir, Amihood, Landau, Gad M., Lewenstein, Moshe, Lewenstein, Noa
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 15.11.1998 Elsevier Science
Schlagworte:	Analysis of algorithms Applied sciences Approximate pattern matching Combinatorial algorithms on words Computer science; control theory; systems Data processing. List processing. Character string processing Design of algorithms Exact sciences and technology Generalized pattern matching Memory organisation. Data processing Pattern matching Pattern Matching with Swaps Software Design of algorithms Combinatorial algorithms on words Pattern Matching with Swaps Analysis of algorithms Generalized pattern matching Pattern matching Approximate pattern matching Alphabet Data processing
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!