Computing Quasi Suffix Arrays
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03089594" target="_blank" >RIV/68407700:21230/03:03089594 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computing Quasi Suffix Arrays
Original language description
We introduce quasi-suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi-suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example, pattern-matching or calculation of repeating substrings.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Automata, Languages and Combinatorics
ISSN
1430-189X
e-ISSN
—
Volume of the periodical
8
Issue of the periodical within the volume
4
Country of publishing house
DE - GERMANY
Number of pages
14
Pages from-to
593-606
UT code for WoS article
—
EID of the result in the Scopus database
—