Finding all Common Intervals of k Permutations

Heber S, Stoye J (2001)
In: Proc. of CPM 2001. LNCS, 2089. 207-218.

Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
Conference
CPM 2001
Location
Jerusalem, Israel
PUB-ID

Cite this

Heber S, Stoye J. Finding all Common Intervals of k Permutations. In: Proc. of CPM 2001. LNCS. Vol 2089. 2001: 207-218.
Heber, S., & Stoye, J. (2001). Finding all Common Intervals of k Permutations. Proc. of CPM 2001, 2089, 207-218.
Heber, S., and Stoye, J. (2001). “Finding all Common Intervals of k Permutations” in Proc. of CPM 2001 LNCS, vol. 2089, 207-218.
Heber, S., & Stoye, J., 2001. Finding all Common Intervals of k Permutations. In Proc. of CPM 2001. LNCS. no.2089 pp. 207-218.
S. Heber and J. Stoye, “Finding all Common Intervals of k Permutations”, Proc. of CPM 2001, LNCS, vol. 2089, 2001, pp.207-218.
Heber, S., Stoye, J.: Finding all Common Intervals of k Permutations. Proc. of CPM 2001. LNCS. 2089, p. 207-218. (2001).
Heber, Steffen, and Stoye, Jens. “Finding all Common Intervals of k Permutations”. Proc. of CPM 2001. 2001.Vol. 2089. LNCS. 207-218.
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