Inferring strings from suffix trees and links on a binary alphabet.
Tomohiro IShunsuke InenagaHideo BannaiMasayuki TakedaPublished in: Discret. Appl. Math. (2014)
Keyphrases
- suffix tree
- suffix array
- string matching
- pattern matching
- hamming distance
- approximate string matching
- data structure
- finite alphabet
- tree construction
- finite automata
- periodicity detection
- disk resident
- space requirements
- space efficient
- databases
- regular expressions
- inverted file
- data compression
- main memory
- neural network
- string kernels
- information retrieval
- data sets