Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String
The KIPS Transactions:PartA, Vol. 16, No. 5, pp. 319-326, Oct. 2009
10.3745/KIPSTA.2009.16.5.319, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
S. M. Han and J. W. Woo, "Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String," The KIPS Transactions:PartA, vol. 16, no. 5, pp. 319-326, 2009. DOI: 10.3745/KIPSTA.2009.16.5.319.
[ACM Style]
Seon Mi Han and Jin Woon Woo. 2009. Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String. The KIPS Transactions:PartA, 16, 5, (2009), 319-326. DOI: 10.3745/KIPSTA.2009.16.5.319.