We consider how to index strings, trees and graphs for jum- bled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches.
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs
Cicalese, Ferdinando;Liptak, Zsuzsanna;RIZZI, ROMEO;
2013-01-01
Abstract
We consider how to index strings, trees and graphs for jum- bled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
SPIRE2013.pdf
solo utenti autorizzati
Tipologia:
Versione dell'editore
Licenza:
Copyright dell'editore
Dimensione
160.37 kB
Formato
Adobe PDF
|
160.37 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
