Practical Algorithmic Techniques for Several String Processing Problems

Details Practical Algorithmic Techniques for Several String Processing Problems Practical Algorithmic Techniques for Several String Processing Problems

2009-12-04

arxiv.org/abs/0912.0807v1

Proceedings of the 8th RoEduNet International Conference, pp. 136-141, Galati, Romania, 3-4 December, 2009. (ISBN: 978-606-808

Computer Science

Data Structures and Algorithms

Scientific paper

The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or searching for specific patterns within texts, occur frequently in this context. In this paper we present several novel and practical algorithmic techniques for processing textual data (strings) in order to efficiently solve multiple problems. Our techniques make use of efficient string algorithms and data structures, like KMP, suffix arrays, tries and deterministic finite automata.

Affiliated with

Also associated with

No associations

Rating

Practical Algorithmic Techniques for Several String Processing Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Practical Algorithmic Techniques for Several String Processing Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical Algorithmic Techniques for Several String Processing Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420458