z-logo
open-access-imgOpen Access
Application of Evenly Sparse Suffix Tree for String Processing Tasks
Author(s) -
Sergey Fedorovich Svinyin,
I. A. Andrianov
Publication year - 2014
Publication title -
spiiras proceedings
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 9
eISSN - 2078-9599
pISSN - 2078-9181
DOI - 10.15622/sp.34.13
Subject(s) - generalized suffix tree , computer science , suffix , suffix tree , string (physics) , tree (set theory) , theoretical computer science , mathematics , combinatorics , programming language , data structure , linguistics , philosophy , mathematical physics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom