k-Abelian Pattern Matching

zum Volltext (712 kB)   ZIP
Beteiligte Person(en) / Institution(en)Autor :
DatumErschienen :
  • März 2014
Seitenbereich23 S.

Two words are called \(k\)-abelian equivalent, if they share the same multiplicities for all factors of length at most \(k\). We present an optimal linear time algorithm for identifying all occurrences of factors in a text that are \(k\)-abelian equivalent to some pattern. Moreover, an optimal algorithm for finding the largest \(k\) for which two words are \(k\)-abelian equivalent is given. Solutions for various online versions of the \(k\)-abelian pattern matching problem are also proposed.
Statische URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000021
 
URN:NBNurn:nbn:de:101:1-2014042511074
IDNummer des Berichts :
  • TR_1402