On building minimal automaton for subset matching queries

Details On building minimal automaton for subset matching queries On building minimal automaton for subset matching queries

2010-04-06

arxiv.org/abs/1004.0902v2

Computer Science

Formal Languages and Automata Theory

Accepted to IPL

Scientific paper

We address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $\sigma$, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) $p$ occurs in the set. That is, we need to efficiently find a string $d \in D$ such that $p[i] \in d[i]$ for every $i$. We show how to build such index in $O(n^{\log_{\sigma/\Delta}(\sigma)}\log(n))$ average time, where $\Delta$ is the average size of the subsets. Our methods have applications e.g.\ in computational biology (haplotype inference) and music information retrieval.

Affiliated with

Also associated with

No associations

Rating

On building minimal automaton for subset matching queries 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 On building minimal automaton for subset matching queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On building minimal automaton for subset matching queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57781