S.: Efficient discovery of proximity patterns with suffix arrays (extended abstract (2001) [4 citations — 0 self]

Download:

by Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa

In: Proc. the 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01). Volume 2089 of LNCS., Springer-Verlag

http://www.i.kyushu-u.ac.jp/~arim/papers/arim-asaka-cpm01poster.pdf

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Arimura01s.:efficient,
    author = {Hiroki Arimura and Hiroki Asaka and Hiroshi Sakamoto and Setsuo Arikawa},
    title = {S.: Efficient discovery of proximity patterns with suffix arrays (extended abstract},
    booktitle = {In: Proc. the 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01). Volume 2089 of LNCS., Springer-Verlag},
    year = {2001},
    pages = {152--156}
}

Abstract:

Abstract. We describe an efficient implementation of a text mining algorithm for discovering a class of simple string patterns.With an index structure, called the virtual suffix tree, for pattern discovery built on the top of the suffix array, the resulting algorithm is simple and fast in practice compared with the previous implementation with the suffix tree. 1

Citations

391	A space-economical suffix tree construction algorithm – McCreight - 1976
385	Suffix arrays: A new method for on-line string searches – Manber, Myers - 1993
151	On Finding Lowest Common Ancestors: Simplification and Parallelization – Schieber, Vishkin - 1988
136	Towards efficient ag-nostic learning – Kearns, Schapire, et al. - 1994
96	Reuters-21578 text categorization test collection distribution 1.0. http://www.research.att.com/∼lewis – Lewis - 1999
38	K.: Linear-time LongestCommon-Prefix Computation in Suffix Arrays and Its Applications – Kasai, Lee, et al. - 2001
38	An algorithm for string matching with a sequence of don't cares – Manber, Baeza-Yates - 1991
26	On classification and regression – Morishita - 1998
13	Efficient discovery of optimal word-association patterns in large text databases – Shimozono, Arimura, et al. - 2000
12	A fast algorithm for discovering optimal string patterns in large text databases – Arimura, Wataki, et al. - 1998
2	Text data mining: discovery of important keywords in the cyberspace – Arimura, Abe, et al. - 2001
1	G.Lugosi, A Probablistic Theory – Devroye
1	B.Shapiro, D.Shasha and K.Zhang – Wang, Marr - 1994

View or Download | Add to My Collection | Correct Errors