Exemplary systems, methods and computer-accessible mediums can receive first data related to at least one first string arranged in a directed acyclic graph, compress the first data into second data, and can search the second data for a match of at least one second string. A node of the directed acyclic graph can encode at least one substring, and an edge of the directed acyclic graph can encode instructions for concatenating substrings.
System, methods and computer-accessible mediums for utilizing pattern matching in stringomes
FERRAGINA, PAOLO;
2013-01-01
Abstract
Exemplary systems, methods and computer-accessible mediums can receive first data related to at least one first string arranged in a directed acyclic graph, compress the first data into second data, and can search the second data for a match of at least one second string. A node of the directed acyclic graph can encode at least one substring, and an edge of the directed acyclic graph can encode instructions for concatenating substrings.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
