Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

IMCSIT
2010

favoriteEmaildiscussreport

110views Information Technology» more IMCSIT 2010»

Finding Patterns in Strings using Suffixarrays

13 years 8 months ago

Finding Patterns in Strings using Suffixarrays

Download proceedings2010.imcsit.org

Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed system that exploits the internal structure of the enhanced suffixarray to find significant patterns in a large collection of sequences. The system searches exhaustively for all significantly compressing patterns where patterns may consist of symbols and skips or wildcards. We demonstrate a possible application of the system by detecting interesting patterns in a Dutch and an English corpus.

Herman Stehouwer, Menno van Zaanen

Real-time Traffic

Enhanced Suffixarray | IMCSIT 2010 | Information Technology | Interesting Patterns | Significant Patterns |

claim paper

Related Content

» Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance

» A Practical Algorithm to Find the Best Subsequence Patterns

» Finding Witnesses by Peeling

» Learning OneVariable Pattern Languages Very Efficiently on Average in Parallel and by Aski...

» String transformationbased Bayesian classification or proteins

» Lossless filter for multiple repetitions with Hamming distance

» SPINE Putting Backbone into String Indexing

» A Fast BitVector Algorithm for Approximate String Matching Based on Dynamic Programming

» Pointset algorithms for pattern discovery and pattern matching in music

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	IMCSIT
Authors	Herman Stehouwer, Menno van Zaanen

Comments (0)