Suffix Tree Construction in RAM (1997; Farach-Colton)

Stoye J (2008)
In: Encyclopedia of Algorithms. Kao M-Y (Ed);Springer Verlag: 925-928.

Encyclopedia Article | Published | English

No fulltext has been uploaded

Book Editor
Kao, Ming-Yang
Publishing Year
PUB-ID

Cite this

Stoye J. Suffix Tree Construction in RAM (1997; Farach-Colton). In: Kao M-Y, ed. Encyclopedia of Algorithms. Springer Verlag; 2008: 925-928.
Stoye, J. (2008). Suffix Tree Construction in RAM (1997; Farach-Colton). In M. - Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 925-928). Springer Verlag.
Stoye, J. (2008). “Suffix Tree Construction in RAM (1997; Farach-Colton)” in Encyclopedia of Algorithms, ed. M. - Y. Kao (Springer Verlag), 925-928.
Stoye, J., 2008. Suffix Tree Construction in RAM (1997; Farach-Colton). In M. - Y. Kao, ed. Encyclopedia of Algorithms. Springer Verlag, pp. 925-928.
J. Stoye, “Suffix Tree Construction in RAM (1997; Farach-Colton)”, Encyclopedia of Algorithms, M.-Y. Kao, ed., Springer Verlag, 2008, pp.925-928.
Stoye, J.: Suffix Tree Construction in RAM (1997; Farach-Colton). In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. p. 925-928. Springer Verlag (2008).
Stoye, Jens. “Suffix Tree Construction in RAM (1997; Farach-Colton)”. Encyclopedia of Algorithms. Ed. Ming-Yang Kao. Springer Verlag, 2008. 925-928.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar