An Incomplex Algorithm for Fast Suffix Array Construction

Schürmann K-B, Stoye J (2005)
In: Proc. of ALENEX/ANALCO 2005. 77-85.

Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
Conference
ALENEX/ANALCO 2005
Location
Vancouver, BC, Canada
ISBN
PUB-ID

Cite this

Schürmann K-B, Stoye J. An Incomplex Algorithm for Fast Suffix Array Construction. In: Proc. of ALENEX/ANALCO 2005. 2005: 77-85.
Schürmann, K. - B., & Stoye, J. (2005). An Incomplex Algorithm for Fast Suffix Array Construction. Proc. of ALENEX/ANALCO 2005, 77-85.
Schürmann, K. - B., and Stoye, J. (2005). “An Incomplex Algorithm for Fast Suffix Array Construction” in Proc. of ALENEX/ANALCO 2005 77-85.
Schürmann, K.-B., & Stoye, J., 2005. An Incomplex Algorithm for Fast Suffix Array Construction. In Proc. of ALENEX/ANALCO 2005. pp. 77-85.
K.-B. Schürmann and J. Stoye, “An Incomplex Algorithm for Fast Suffix Array Construction”, Proc. of ALENEX/ANALCO 2005, 2005, pp.77-85.
Schürmann, K.-B., Stoye, J.: An Incomplex Algorithm for Fast Suffix Array Construction. Proc. of ALENEX/ANALCO 2005. p. 77-85. (2005).
Schürmann, Klaus-Bernd, and Stoye, Jens. “An Incomplex Algorithm for Fast Suffix Array Construction”. Proc. of ALENEX/ANALCO 2005. 2005. 77-85.
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
ISBN Search