Index Structures for Large Sequence Data: Suffix Trees and Affix Trees

Stoye J (2002)
In: Lecture Notes in Informatics. Schubert S, Reusch B, Jesse N (Eds);P-20. 67-67.

Conference Abstract | Published | English

No fulltext has been uploaded

Editor
Schubert, Sigrid ; Reusch, Bernd ; Jesse, Norbert
Publishing Year
Conference
GI-Jahrestagung 2002: Informatik bewegt
Location
Dortmund, Germany
PUB-ID

Cite this

Stoye J. Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. In: Schubert S, Reusch B, Jesse N, eds. Lecture Notes in Informatics. Vol P-20. 2002: 67-67.
Stoye, J. (2002). Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. In S. Schubert, B. Reusch, & N. Jesse (Eds.), Lecture Notes in Informatics (Vol. P-20, pp. 67-67).
Stoye, J. (2002). “Index Structures for Large Sequence Data: Suffix Trees and Affix Trees” in Lecture Notes in Informatics, ed. S. Schubert, B. Reusch, and N. Jesse, vol. P-20, 67-67.
Stoye, J., 2002. Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. In S. Schubert, B. Reusch, & N. Jesse, eds. Lecture Notes in Informatics. no.P-20 pp. 67-67.
J. Stoye, “Index Structures for Large Sequence Data: Suffix Trees and Affix Trees”, Lecture Notes in Informatics, S. Schubert, B. Reusch, and N. Jesse, eds., vol. P-20, 2002, pp.67-67.
Stoye, J.: Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. In: Schubert, S., Reusch, B., and Jesse, N. (eds.) Lecture Notes in Informatics. P-20, p. 67-67. (2002).
Stoye, Jens. “Index Structures for Large Sequence Data: Suffix Trees and Affix Trees”. Lecture Notes in Informatics. Ed. Sigrid Schubert, Bernd Reusch, and Norbert Jesse. 2002.Vol. P-20. 67-67.
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